Let G be an undirected connected graph with distinct edge weight. Let e_max be…

PYQ GATE 2000

Let G be an undirected connected graph with distinct edge weight. Let e_max be the edge with maximum weight and e_min the edge with minimum weight. Which of the following statements is false?

  1. A.

    Every minimum spanning tree of G must contain e_min

  2. B.

    If e_max is in a minimum spanning tree, then its removal must disconnect G

  3. C.

    No minimum spanning tree contains e_max

  4. D.

    G has a unique minimum spanning tree

Attempted by 183 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…