Question

Consider a weighted complete graph G on the vertex set

{v1,v2 ,v} such that the weight of the edge (v,v) is 2|i-j|. The weight of a minimum spanning tree of G is:

A n – 1

B 2n – 2

C nC2

D 2

Practice Next

More IT Networking Questions

Solution