62 62 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 17.4k views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply kickassakash commented Nov 19, 2023 reply Follow flag gate pyq on same topic https://gateoverflow.in/39673/gate-cse-2016-set-1-question-14 1 1 replyShare SilentClimber commented Jan 5, 2024 reply Follow flag 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$ 1 1 replyShare aashish1406 commented Jan 22, 2024 reply Follow flag Try to solve by just taking small graph 5 5 replyShare Please log in or register to add a comment.
Best answer 99 99 votes First find no of edges in mst. Mst has $n-1$ edges where $n$ is no of vertices. $100-1 =99$ edges Each $99$ edges in mst increases by $5$ so weight in mst increased $99*5=495$ Now total weight of mst $=500+495=995$ Anoop Sonkar answered Feb 15, 2015 • edited Jun 24, 2018 by Milicevic3306 Anoop Sonkar comment Share Follow See all 2 Comments 2 2 Comments reply Kuldeep Pal commented Jan 15, 2018 reply Follow flag In question 300 edges given what does that statement say ? I didn't get it ? 2 2 replyShare nailwalhimanshu commented Jan 16, 2018 reply Follow flag The total number of edges present in a graph is 300. But as we know that the minimum number of edges required in a minimal connected single component graph is n-1. 12 12 replyShare Please log in or register to add a comment.
10 10 votes No of edges =99 , now mention condition 99*5 = 495+500 = 995 chaman_amit answered May 2, 2015 chaman_amit comment Share Follow 0 reply Please log in or register to add a comment.
6 6 votes Since there are 100 vertices, there must be 99 edges in Minimum Spanning Tree (MST). When weight of every edge is increased by 5, the increment in weight of MST is = 99 * 5 = 495 So new weight of MST is 500 + 495 which is 995 Regina Phalange answered Apr 29, 2017 Regina Phalange comment Share Follow 0 reply Please log in or register to add a comment.
4 4 votes Adding or multiplying all the edges of an MST by a constant does not change the MST, it only changes the value of MST. Vertices = 100. Hence, edges in the MST = 99. Weight = 500 Since the MST would remain the same; just the edge weights would be upgraded by 5, upgraded MST weight: $500+99(5)=995$ JashanArora answered Jan 25, 2020 JashanArora comment Share Follow 0 reply Please log in or register to add a comment.
0 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 1 1 comment reply kickassakash commented Nov 19, 2023 reply Follow flag gate pyq on same topic https://gateoverflow.in/39673/gate-cse-2016-set-1-question-14 1 1 replyShare Please log in or register to add a comment.
0 0 votes the formula is [total present cost] + [no.of edges * added amount] (just from repeated observations with various values, check for yourself) total present cost is 500 no.of edges are n-1 = 99 added amount is 5 plug in the values we get 995 anon1 answered Jan 27 anon1 comment Share Follow 0 reply Please log in or register to add a comment.