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.

icon
Related questions
Question
100%
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.
Transcribed Image Text: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.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer