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.
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.)
Step by Step Solution
3.21 Rating (168 Votes )
There are 3 Steps involved in it
If G is a tree it has no cycles and has n 1 edges by Prob 18 Conversely let ... View full answer
Get step-by-step solutions from verified subject matter experts
