edited by
591 views
0 votes
0 votes

Original question - https://gateoverflow.in/204122/gate2018-47

Consider the following undirected graph G:

Choose a value for x that will minimize the number of minimum weight spanning trees (MWSTs) of G. The number of MWSTs of G for this value of x is ____

The variance in this question is shown by highlighted text. 

==================================================================================================

Now, if we put x=1 then we will get 2 MST's and that's the minimum MST's that we can get, right? as there are two edges with weight 4.

Edit : on {x=1,2,3,4,6,7, . .. . .   . . .} ie for any value of x which is not equal to 5, we wil always get 2 MST's.

So, if it would be what would be minimum value of x for which we get minimum MST's then x=1 would be correct.

edited by

1 Answer

Related questions

0 votes
0 votes
3 answers
1
iarnav asked Apr 29, 2018
1,589 views
Question 1) The shortest-path tree computed by Dijkstra's algorithm is necessarily an MST?Question2 ) Prim's algorithm works with negative weighted edges?
0 votes
0 votes
2 answers
4
iarnav asked Apr 28, 2018
397 views
Let G be a connected simple graph with non distinct edge weights. Now, e be the lightest edge in G. So, does this edge e is present in every MST of G?My take - when all e...