Let G be a connected undirected weighted graph. Consider the following two…
GATE · 2021 · CS · Set 2 · Computer Science & IT
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?
- A.
Both S1 and S2 are true
- B.
S1 is true and S2 is false
- C.
S1 is false and S2 is true
- D.
Both S1 and S2 are false
Attempted by 553 students.
Sign up free to check your answer
Sign up freeLoading lesson…