Q. 53 Let G be a connected undirected graph of 100 vertices and 300 edges. The weight
of a minimum spanning tree of G is 500. When the weight of each edge of G is
increased by five, the weight of a minimum spanning tree becomes _______.
(A) 1000
(B) 995
(C) 2000
(D) 1995
Answer: (B)
Explanation:
