Q. 11 Let w be the minimum weight among all edge weights in an undirected connected
graph, Let e be a specific edge of weight w. Which of the following is FALSE ?
(A) There is a minimum spanning tree containing e.
(B) If e is not in a minimum spanning tree T,then in the cycle formed by
adding e to T, all edges have the same weight.
(C) Every minimum spanning tree has an edge of weight w
(D) e is present in every minimum spanning tree
Answer: (D)
Explanation:
