Multiple choice

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?

  1. There is a minimum spanning tree containing e.

  2. 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.

  3. Every minimum spanning tree has an edge of weight w.

  4. e is present in every minimum spanning tree.
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Keep practicing — related questions