how to prove number of edges in a minimum spanning tree

Jack Duan 0
Viewed 9

Fix T to be the minimum spanning tree of G(V,E), G is an undirected graph with n vertices. why is there n-1 edges in the minimum spanning tree?

minimum-spanning-tree
0 Answers
Related