9780023606922, Chapter 2 6, Problem 6E

Prévia do material em texto

Chapter 2.6, Problem 6E Step-by-step solution Step 1 of 1 Values of m of Kn a graph to be a Tree Complete Graph: A simple graph with vertices is called a complete graph if there is an edge between each pair of different vertices, and it denoted by Tree: If V and W are two vertices in a simple graph T and there exists only one simple path between V and W (inclusive) including all vertices without repetition and also including all edges without repetition, then T is said to be a tree. For all is a cyclic graph, but a tree is an acyclic graph. So, graphs for all >2 are as follows: K2 Therefore, from the definition of the tree, for = 1 and n=2, a complete graph is a tree. Hence, the value n is either 1 or