Q39

MSQ2 marks

Let $G(V, E)$ be a simple, undirected, edge-weighted graph with unique edge weights. Which of the following statements about the minimum spanning trees (MST) of $G$ is/are true?

(A)

In every cycle $C$ of $G$ , the edge with the largest weight in $C$ is not in any MST

(B)

In every cycle $C$ of $G$ , the edge with the smallest weight in $C$ is in every MST

(C)

For every vertex $v \in V$ , the edge with the largest weight incident on $v$ is not in any MST

(D)

For every vertex $v \in V$ , the edge with the smallest weight incident on $v$ is in every MST

Loading…