Let ๐บ be any connected, weighted, undirected graph.
Q. Let ๐บ be any connected, weighted, undirected graph.
- ๐บ has a unique minimum spanning tree, if no two edges of ๐บ have the same weight.
- ๐บ 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
Ans: ย Both I and II