Q8

MCQ1 mark, −0.33

Let $G$ be any undirected graph with positive edge weights, and $T$ be a minimum spanning tree of $G$ . For any two vertices, $u$ and $v$ , let $d_{1}(u, v)$ and $d_{2}(u, v)$ be the shortest distances between $u$ and $v$ in $G$ and $T$ , respectively. Which ONE of the options is CORRECT for all possible $G, T, u$ and $v$ ?

(A)

$d_{1}(u, v)=d_{2}(u, v)$

(B)

$d_{1}(u, v) \leq d_{2}(u, v)$

(C)

$d_{1}(u, v) \geq d_{2}(u, v)$

(D)

$d_{1}(u, v) \neq d_{2}(u, v)$

Loading…