engineering recuitment GATE CSE 2023-24 Test Series Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
Let G be any connected, positive weighted, undirected graph with n +1 nodes
Which of the below-given statements is/are TRUE?
1
G has a unique minimum spanning tree, if no two edges of G have the same weight.
2
If the minimum cost edge e of a graph is unique, then this edge is included in any MST.
3
G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut.
4
Number of edges in minimum spanning tree is always n.