Consider a weighted complete graph G on the vertex set {v1, v2, ..vn} such…
GATE · 2006 · CS
Consider a weighted complete graph G on the vertex set {v1, v2, ..vn} 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.
C(n, 2)
- D.
n²
Attempted by 358 students.
Sign up free to check your answer
Sign up freeLoading lesson…