Explore BrainMass

Minimum spanning tree proof


Is the statement below TRUE or FALSE. Why?

Question :

I have a connected weighted undirected graph G with a minimum spanning tree T. If I increase the weight of one edge, the new minimum spanning tree T' of the new graph G' differs from T in at most one edge.

Solution Summary

This shows how to determine if a statement regarding a minimum spanning tree is true or false.