The GATE Grind

GATE 2007 CS – Question 49

Algorithms · Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths · 2 marks · Multiple choice

In a connected undirected graph, w is the minimum edge weight and e is a specific edge of weight w. Which statement is FALSE?

  1. Some minimum spanning tree contains e.
  2. If e is absent from MST T, all edges in the cycle formed by adding e to T have equal weight.
  3. Every MST has an edge of weight w.
  4. Every MST contains e.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) Every MST contains e.

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths questions

All Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths questions →