Open In App
Related Articles

Algorithms | Graph Minimum Spanning Tree | Question 7

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false? (GATE CS 2000) (A) Every minimum spanning tree of G must contain emin (B) If emax is in a minimum spanning tree, then its removal must disconnect G (C) No minimum spanning tree contains emax (D) G has a unique minimum spanning tree

Answer: (C)

Explanation: (a) and (b) are always true. (c) is false because (b) is true. (d) is true because all edge weights are distinct for G.

Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads