Aug2016 cs Q33

0. Consider a weighted complete graph G on the vertex set {ν₁, ν₂, .... ν_n} such that the weight of the edge (ν_i, ν_j) is 4 | i – j|. The weight of minimum cost spanning tree of G is :

Answer
Comment
Array

Option : C
Explanation :

Forgot your password?

I agree with the Terms.