A graph with n vertices is a tree if and only if it has n - 1
Question:
A graph with n vertices is a tree if and only if it has n - 1 edges and has no cycles.
Data from Prob. 16
If a graph has no cycles, it must have at least 2 vertices of degree 1
Data from Prob. 18
A tree with n vertices has n - 1 edges. (Proof by induction.)
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
If G is a tree it has no cycles and has n 1 edges by Prob 18 Conversely let ...View the full answer
Answered By
Bhartendu Goyal
Professional, Experienced, and Expert tutor who will provide speedy and to-the-point solutions. I have been teaching students for 5 years now in different subjects and it's truly been one of the most rewarding experiences of my life. I have also done one-to-one tutoring with 100+ students and help them achieve great subject knowledge. I have expertise in computer subjects like C++, C, Java, and Python programming and other computer Science related fields. Many of my student's parents message me that your lessons improved their children's grades and this is the best only thing you want as a tea...
2+ Reviews
10+ Question Solved
Related Book For 
Question Posted:
