Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
Let G be an undirected connected graph with distinct edge weights . Let emax be the edge with maximum weight and emin be the edge with minimum weight. Which of the following statements is false.
1
Every minimum spanning tree of G must contain emin
2
If emax is in a minimum spanning tree, then its removal must be disconnected G.
3
No minimum spanning tree contains emax
4
G has a unique minimum spanning tree.