Question:-
Common Data Questions: 50 & 51

Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in the matrix W below is the weight of the edge {i, j}.



Q. What is the minimum possible weight of a spanning tree T in this graph such that vertex 0 is a leaf node in the tree T?
Option (A)
7
Option (B)
8
Option(C)
9
Option(D)
10
Correct Option:
(D)
question-answer-faq-2254