DT Q35

Home
DT Q35

35Let 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 _______.

Option : A
Explanation :

Here 3 can’t be taken because it will produce a cycle so take 4.
This solution is 1 + 2 + 4 = 7

Forgot your password?

I agree with the Terms.