82 82 votes Let $G$ be a weighted graph with edge weights greater than one and $G'$ be the graph constructed by squaring the weights of edges in $G$. Let $T$ and $T'$ be the minimum spanning trees of $G$ and $G'$, respectively, with total weights $t$ and $t'$. Which of the following statements is TRUE? $T' = T$ with total weight $t' = t^2 $ $T' = T$ with total weight $t' < t^2$ $T' \neq T$ but total weight $t' = t^2$ None of the above Algorithms gatecse-2012 algorithms minimum-spanning-tree normal marks-to-all + – gatecse 28.6k views answer comment Share Follow Print See all 16 Comments 16 16 Comments reply Show 13 previous comments P0535_Yedidyah_Sagar commented Aug 19 reply Follow flag T and T' will be same If G has duplicate weights, then T itself is not unique t' <= t^2 1 1 replyShare Honey badger commented Aug 19 reply Follow flag Thanks brother, I got it 👍 😄, problem with my statement. 1 1 replyShare P0535_Yedidyah_Sagar commented Aug 19 reply Follow flag @Honey badgerThere is nothing wrong with your comment. It is correct. I added my comment independently. Regarding the inequality : t' = t^2 for single edge graph between two vertices. Otherwise t' will always be less than t^2 1 1 replyShare Please log in or register to add a comment.
0 0 votes T and T' can be diffrent because MST need not be unique suppose there are 2 edges with same weight then we can draw different MST's if in question it would have been given distinct weight then ofocurse T = T' but since not mentioned T may not be equal T' 2 . sum of squares is always less than squared sum of numbers ( 1 + 2 + 3 ) **2 = 36 > 1**2 + 2**2 + 3**2 = 36 > 13 so t' < t**2 Since no option matches given answer is D Akashsr3 answered May 16 Akashsr3 comment Share Follow 0 reply Please log in or register to add a comment.