GATE CS 2016 Set 2 – Question 36

Numerical answer 2 marks Question 36 2016

Question 36

NAT 2 marks · no negative Algorithms

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 ______.

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2016 Algorithms

Source: GATE 2016 Computer Science and Information Technology, Set 2, Q36 (question number approximate)

All Algorithms questions