Anshul Kumar Posted on Sep 13, 2019 03:40 PM
It's answer should be c. Because this graph is connected and distinct edge so that G has a unique MST and every MST contain emin edge because emin edge have minimum cost
So option A and D are true
Now for option B we can make a graph in which we have to take a maximum cost edge in MST for eg. Edge with cost (a,b)=1, (b,c)=2, (c,a)=3, and (a,d)=4 if we construct this graph than we have to take a,d edge in MST bcz we don't have choice so this edge removal must disconnect graph so option B also true
But option C is false bcz from above eg. We can construct a MST which contains emax edge .