9780023606922, Chapter 2 6, Problem 2E

Prévia do material em texto

Chapter 2.6, Problem 2E Step-by-step solution Step 1 of 1 Trees 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. Conceder the following graph: 4 6 3 2 From the graph, all the vertices 1. 2.3. 4 and 5 are connected each and every other vertex. But there are two paths from 3 to one is 3-4-5 and other is This implies the path from 3 to 5 is not unique. From the definition of tree, the above graph is not a tree as the path from one vertex to other in a tree should be unique. Hence, the graph is not a