Open In App
Related Articles

GATE | GATE CS 2011 | Question 54

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Share
Report issue
Report
An undirected graph G(V, E) contains n ( n > 2 ) nodes named v1 , v2 ,….vn. Two nodes vi , vj are connected if and only if 0 < |i – j| <= 2. Each edge (vi, vj ) is assigned a weight i + j. A sample graph with n = 4 is shown below. What will be the cost of the minimum spanning tree (MST) of such a graph with n nodes? (A) 1/12(11n^2 – 5n) (B) n^2 – n + 1 (C) 6n – 11 (D) 2n + 1

Answer: (B)

Explanation:

See https://www.geeksforgeeks.org/data-structures-and-algorithms-set-27/



Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads