44 votes 44 votes 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 ______. Algorithms gatecse-2015-set3 algorithms minimum-spanning-tree easy numerical-answers + – go_editor asked Feb 15, 2015 • edited Nov 21, 2017 by kenzou go_editor 11.0k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply kickassakash commented Nov 19, 2023 reply Follow Share gate pyq on same topic https://gateoverflow.in/39673/gate-cse-2016-set-1-question-14 0 votes 0 votes Akash 15 commented Jan 5 reply Follow Share Here $300$ edges in $G$ this information has no use for soln. Only use $100$ vertices and the given weight of MST $500$, weight increase of $5$ 0 votes 0 votes Ray Tomlinson commented Jan 22 reply Follow Share Try to solve by just taking small graph 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes To connect 100 vertex we need 99 edges. as previously the MST has weight as 500. Now that 500 + (99 * 5 ) = 995 in total so Final wight of MST is 995. ProtonicRED answered Jan 10, 2022 ProtonicRED comment Share Follow See 1 comment See all 1 1 comment reply kickassakash commented Nov 19, 2023 reply Follow Share gate pyq on same topic https://gateoverflow.in/39673/gate-cse-2016-set-1-question-14 0 votes 0 votes Please log in or register to add a comment.