Nov2017 cs Q36

0. An undirected graph G (V, E) contains n (n > 2) nodes named v₁ , v₂ ,...,v_n. Two nodes v_i and v_j are connected if and only if 0 < │ i − j│ ≤ 2. Each edge (v_i , v_j ) is assigned a weight i+j. The cost of the minimum spanning tree of such a graph with 10 nodes is:

Answer
Comment
Array

Option : B
Explanation :

Forgot your password?

I agree with the Terms.