Q. 55 An undirected graph G(V,E)G(V,E) contains n(n>2)n(n>2) nodes named v1,v2,…,vnv1,v2,…,vn. Two nodes vi,vjvi,vj are connected if and only if <∣i−j∣≤20<∣i−j∣≤2. Each edge (vi,vj)(vi,vj) is assigned a weight i+ji+j. A sample graph with n=4n=4 is shown below.
The length of the path from v5 to v6 in the MST of previous question with n = 10
is
(A) 11
(B) 25
(C) 31
(D) 41
Answer: (C)
Explanation:
