Suppose you are given a connected graph G, with edge costs that are all distinct. Prove that G has a unique minimum spanning tree.
Suppose there are two minimum trees, A and B. Let e be the edge in just one of A,B with the smallest cost. Suppose it is in A... View the full answer
Sign up to view the full answer
Proof by contradiction: Suppose the graph has two different minimum spanning tree's, S1 and S2.Then it is mandatory that... View the full answer