Q40

MCQ2 marks, −0.67

$G=(V, E)$ is an undirected simple graph in which each edge has a distinct weight, and $e$ is a particular edge of $G$ . Which of the following statements about the minimum spanning trees $(MSTs)$ of $G$ is/are TRUE? I only. II only. Both I and II. Neither I nor II.

(A)

If $e$ is the lightest edge of some cycle in $G$ , then every MST of $G$ includes $e$ .

(B)

If $e$ is the heaviest edge of some cycle in $G$ , then every MST of $G$ excludes $e$ .

Loading…