Q. 3 Consider a complete undirected graph with vertex set {,1,2,3,4}{0,1,2,3,4}. Entry WijWij in the matrix WW below is the weight of the edge {i,j}
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 ?
(A) 7
(B) 8
(C) 9
(D) 10
Answer: (D)
Explanation:
