UGC-NET | UGC-NET CS 2017 Dec 2 | Question 23

Let G be an undirected connected graph with distinct edge weight. Let Emax be the edge with maximum weight and E_min the edge with minimum weight. Which of the following statements is false?

(A) Every minimum spanning tree of G must contain E_min.
(B) If E_max is in minimum spanning tree, then its removal must disconnect G.
(C) No minimum spanning tree contains E_max
(D) G has a unique minimum spanning tree.


Answer: (C)

Explanation: Refer: GATE-CS-2000 | Question 41
So,option (C) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up

Save