Let 𝐺 be any connected, weighted, undirected graph. I. 𝐺 has a unique…
GATE · 2019 · CS · Computer Science & IT
Let 𝐺 be any connected, weighted, undirected graph.
I. 𝐺 has a unique minimum spanning tree, if no two edges of 𝐺 have the same weight.
II. 𝐺 has a unique minimum spanning tree, if, for every cut of 𝐺, there is a unique minimum-weight edge crossing the cut.
Which of the above two statements is/are TRUE?
- A.
I only
- B.
II only
- C.
Both I and II
- D.
Neither I nor II
Attempted by 447 students.
Sign up free to check your answer
Sign up freeLoading lesson…