GATE 2007
March 20, 2025Evaluation-System
March 20, 2025GATE 2007
|
Question 49
|
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?
|
There is a minimum spanning tree containing e.
|
|
|
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.
|
|
|
Every minimum spanning tree has an edge of weight w.
|
|
|
e is present in every minimum spanning tree.
|
Question 49 Explanation:
To find minimum Spanning tree(MST), may not be present ‘e’ in every MST graph.
Correct Answer: D
Question 49 Explanation:
To find minimum Spanning tree(MST), may not be present ‘e’ in every MST graph.