818 views
3 votes
3 votes
Show that a graph has a unique minimum spanning tree if, for every cut of the graphs, there is a unique line edge crossing the cut. Show that the converse is not true by giving a counter example.

I'm more interested in the converse.

Please explain in detail.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
3 votes
3 votes
1 answer
2
Pooja Palod asked Oct 15, 2015
2,992 views
Suppose that edge weights are uniformly distributed over half open interval $[0,1)$. Which algorithm kruskal's or prim's can make you run faster?
1 votes
1 votes
1 answer
4
Arjun asked Feb 16
1,625 views
The number of distinct minimum-weight spanning trees of the following graph is