GATE Computer Science (CS) 2019 Solved Papers
© examsiri.com
Question : 48 of 65
Marks:
+1,
-0
Let G be any connected, weighted, undirected graph.
I. G has a unique minimum spanning tree, if no two edges of have the same weight.
II. G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut.
Which of the above two statements is/are TRUE?
I. G has a unique minimum spanning tree, if no two edges of have the same weight.
II. G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut.
Which of the above two statements is/are TRUE?
Go to Question: