GATE Computer Science (CS) 2016 Shift 1 Solved Paper

Question : 49 of 65

Marks: +1, -0

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________