How many minimum spanning trees are possible?

How many minimum spanning trees are possible? [closed]

if I have a weighted graph G with E edges and all the edges have unique weights then I know that we can have only 1 unique MST. I was thinking what will be the case if only some of the edges 2 or 3 have same weights then how many minimum spanning trees are possible in such a case?

edited Oct 22 at 0:53

asked Oct 21 at 23:45

logan
1●1

Would you care to provide some details? Please have a read of mathoverflow.net/howtoask – David Roberts Oct 21 at 23:53

By "minimum spanning trees" do you mean "minimum weight spanning trees", where each edge has a weight? – Patricia Hersh Oct 22 at 0:05

Is this homework? Where does this question come from? Voting to close until more detail is given. – Igor Rivin Oct 22 at 0:23

Five. ${}{}{}{}$ – Will Jagy Oct 22 at 0:36

try math.stackexchange.com/questions – Will Jagy Oct 22 at 1:40

show 8 more comments

closed as too localized by Igor Rivin, Will Jagy, Andreas Blass, David Roberts, Chris Godsil Oct 22 at 3:04

Browse other questions tagged decision-trees or ask your own question.

question feed