UGC-NET | UGC-NET CS 2017 Nov – III | Question 36

An undirected graph G (V, E) contains n (n > 2) nodes named v1 , v2 ,…,vn. Two nodes vi and vj are connected if and only if 0 < │ i − j│ ≤2. Each edge (vi , vj ) is assigned a weight i+j. The cost of the minimum spanning tree of such a graph with 10 nodes is:
(A) 88
(B) 91
(C) 49
(D) 21

Answer: (B)


Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.