GATE Computer Science (CS) 2021 Shift 2 Solved Paper
© examsiri.com
Question : 11 of 65
Marks:
+1,
-0
Let G be a connected undirected weighted graph. Consider the following two statements.
S1: There exists a minimum weight edge in G which is present in every minimum spanning tree of G.
S2: If every edge in G has distinct weight, then G has a unique minimum spanning tree. Which one of the following options is correct?
S1: There exists a minimum weight edge in G which is present in every minimum spanning tree of G.
S2: If every edge in G has distinct weight, then G has a unique minimum spanning tree. Which one of the following options is correct?
Go to Question: