Show that a graph has a unique minimum spanning tree
Show that a graph has a unique minimum spanning tree
Show that a graph has a unique minimum spanning tree if, for every cut of the graph, there is a unique light edge crossing the cut. Show that the converse is not true by giving a counterexample.