Consider a graph {G}=( {V}, {E}), where {V}=\{ {v}_{1}, {v}_{2}, . . ., {v}_{100}\}, {E}=\{( {v}_{1}, {v}_{ {j}}) ∣ 1 \leq {i} \leq {j} \leq 100\}, and weight of the edge (v_{i}, v_{j}) is |i-j|. The weight of the minimum spanning tree of G is

GATE Computer Science (CS) 2020 Solved Papers

Question : 53 of 65

Marks: +1, -0

Consider a graph

{G}=( {V}, {E})

, where

{V}=\{ {v}_{1}, {v}_{2}, . . ., {v}_{100}\}, {E}=\{( {v}_{1}, {v}_{ {j}}) ∣ 1 ≤ {i} ≤ {j} ≤ 100\}

, and weight of the edge

(v_{i}, v_{j})

|i-j|

. The weight of the minimum spanning tree of

G

Go to Question:

Prev Question

Next Question