Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is.
[This Question was originally a Fill-in-the-Blanks question]
Explanation: One graph that has maximum possible weight of spanning tree
Quiz of this Question
Please comment below if you find anything wrong in the above post