Mr. Dubey • 100.69K Points
Coach

Q. Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?

(A) every minimum spanning tree of g must contain cd
(B) if ab is in a minimum spanning tree, then its removal must disconnect g
(C) no minimum spanning tree contains ab
(D) g has a unique minimum spanning tree

Correct Answer - Option(C)
Views: 508
Filed under category Design and Analysis of Algorithms

Explanation by: Mr. Dubey

every mst will contain cd as it is smallest edge. so, every minimum spanning tree of g must contain cd is true. and g has a unique minimum spanning tree is also true because the graph has edges with distinct weights. so, no minimum spanning tree contains ab is false.

You must be Logged in to update hint/solution