Q2.18

MCQ2 marks, −0.5

Let $G$ be an undirected connected graph with distinct edge weights. Let $e_{max}$ be the edge with maximum weight and $e_{min}$ the edge with minimum weight. Which of the following statements is false?

(A)

Every minimum spanning tree of $G$ must contain $e_{min}$

(B)

If $e_{max}$ is in a minimum spanning tree, then its removal must disconnect $G$

(C)

No minimum spanning tree contains $e_{max}$

(D)

$G$ has a unique minimum spanning tree

Loading…