Computer Sciences > Gate 2019 > Minimum Spanning Tree
Let G be any connection, weighted, undirected graph:
Which of the above two statements is/are TRUE?
I. G has a unique minimum spanning tree if no two edges of G have the same weight.
II. G has a unique minimum spanning tree if, for every cut G, there is a unique minimum weight edge crossing the cut.
II. G has a unique minimum spanning tree if, for every cut G, there is a unique minimum weight edge crossing the cut.
Which of the above two statements is/are TRUE?
Correct : c
Similar Questions
The graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A, C), (B, C), (...
The number of distinct minimum spanning trees for the weighted graph below is _______. [Image of a weighted graph]
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Total Unique Visitors
Loading......