Related Articles

Related Articles

GATE | GATE-CS-2006 | Question 11
  • Last Updated : 10 Mar, 2014

Consider a weighted complete graph G on the vertex set {v1, v2,} such that the weight of the edge (vi, vj) is 2|i-j|. The weight of a minimum spanning tree of G is: (GATE CS 2006)
(A) n — 1
(B) 2n — 2
(C) nC2
(D) 2

Answer: (B)

Explanation: See Question 5 of

Quiz of this Question


My Personal Notes arrow_drop_up
Recommended Articles
Page :