Q. 54 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.
What will be the cost of the minimum spanning tree (MST) of such a graph with
n nodes?
Answer: (B)
Explanation:
