Let G be a complete undirected graph on 4 vertices, having 6 edges with…
GATE · 2016 · CS · Set 1 · Computer Science & IT
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 _________.
Attempted by 238 students.
Sign up free to check your answer
Sign up freeLoading lesson…