I got a question that states,
It is known that the number of spanning trees in Km,n is given by the function f(m,n) where
Prove that the formula gives the correct number of spanning trees for K2,n.
First of all I found that f(2,n)= n*2^(n-1)
Then i tried to come up with some sort of reasoning about the number of spanning trees, and would then show that it is equivalent to the above, but i'm going round in circles really. I may be going the wrong way about it completely, but not sure, any help would be much appreciated.
Spanning Tree's in the Complete Bipartite Graph Watch
- Thread Starter
- 14-04-2013 15:02
- Study Helper
- 14-04-2013 15:20
Each element connects with at least one of the 2-element subset.
See what you can do from there - there's still some more work involved.