Let \(G\) be a connected undirected graph of 100 vertices and 300 edges. The…

GATE · 2015 · CS · Set 3 · Computer Science & IT

Let GG be a connected undirected graph of 100 vertices and 300 edges. The weight of a minimum spanning tree of GG is 500. When the weight of each edge of GG is increased by five, the weight of a minimum spanning tree becomes ________.

Attempted by 187 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…