154 154 votes $G=(V, E)$ is an undirected simple graph in which each edge has a distinct weight, and $e$ is a particular edge of $G$. Which of the following statements about the minimum spanning trees $(MSTs)$ of $G$ is/are TRUE? If $e$ is the lightest edge of some cycle in $G$, then every MST of $G$ includes $e$. If $e$ is the heaviest edge of some cycle in $G$, then every MST of $G$ excludes $e$. I only. II only. Both I and II. Neither I nor II. Algorithms gatecse-2016-set1 algorithms minimum-spanning-tree normal + – Sandeep Singh 39.7k views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Chhotu commented Aug 27, 2017 reply Follow flag Very Good Question. 12 12 replyShare smsubham commented Dec 25, 2017 i edited by smsubham Dec 25, 2017 reply Follow flag Similar question https://gateoverflow.in/3813/gate2005-it-52 (II) follows reverse krushal's algo http://www.geeksforgeeks.org/reverse-delete-algorithm-minimum-spanning-tree/ 7 7 replyShare ꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂ commented Jan 8, 2024 reply Follow flag $1$ is false here because it can be possible that an edge is lightest for some cycle bt same edge can be maximum for other cycle too As in the given best answer 3 is the lowest weight edge for cycle $3-4-5$ bt it is heaviest for $1-2-3$ . 5 5 replyShare Please log in or register to add a comment.
0 0 votes I think answer is D. Statement I is wrong. Statement II is also wrong, consider any graph where between any two nodes there are two paths, first path consists of edges with weights 2 and 8, second path has weight 5 and 7. So, MST would include that heaviest weight in that cycle. chaitoo answered Feb 16, 2016 chaitoo comment Share Follow See all 2 Comments 2 2 Comments reply Arjun Suresh commented Sep 20, 2016 reply Follow flag You are doing shortest path and not MST. 3 3 replyShare pavansan commented Jan 6, 2025 reply Follow flag @Arjun Suresh sir finally i am able to see how u look like grateful to the visionary pro 1 1 replyShare Please log in or register to add a comment.
0 0 votes here it is given that all edges have distinct value. so by any algo prims or kruskal we are going to add e if it is lightest edge. So first statement is always true and 2nd statement is also true becouse we will always exclue one with the heaviest wieght shashank8141 answered Oct 6, 2018 shashank8141 comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes if for the same question the options were given like :-If e is the lightest edge in G, then every MST of G includes e.If e is the heaviest edge in G, then every MST of G excludes e.then option 1 would have been true while option 2 would be false coz what if the edge e is a brigde then we have to take it in MST.but as cycle is there,so it might be the case that for one cycle it is the lightest but for another cycle heaviest so we cant take it . usher answered Dec 2, 2024 usher comment Share Follow 0 reply Please log in or register to add a comment.