UGC-NET | UGC NET CS 2015 Jun – II | Question 21

Consider the given graph
21 (3)
Its Minimum Cost Spanning Tree is __________.
(1)
21 (4)
(2)
21 (5)
(3)
21 (6)
(4)
21 (7)
(A) (1)
(B) (2)
(C) (3)
(D) (4)


Answer: (B)

Explanation: A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected and undirected graph is a spanning tree with weight less than or equal to the weight of every other spanning tree.
In option (A) weight of tree is = 103 but it is not the subgraph from graph because in original graph there is no edge between node(6) and (7).
In option (B) weight of tree is = 99
In option (C) weight of tree is = 127
In option (D) weight of tree is = 106
So, option (B) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.