# Counting spanning Trees

• September 22nd 2010, 07:25 PM
jzellt
Counting spanning Trees
a) Determine  (K2,m).

(b) How many pairwise non-isomorphic spanning trees does K2,m have?

These are possible exam questions. Can someone show how these are done? Thanks
• September 22nd 2010, 07:58 PM
undefined
Quote:

Originally Posted by jzellt
a) Determine (K2,m).

(b) How many pairwise non-isomorphic spanning trees does K2,m have?

These are possible exam questions. Can someone show how these are done? Thanks

Hmm it's against the rules to give help for questions that count for marks in a class.

However my approach (which applies for many problems) would be to draw diagrams for small cases and review any relevant definitions.

Complete bipartite graph - Wikipedia, the free encyclopedia
• September 22nd 2010, 08:01 PM
jzellt
I didn't mean that these are going to be exam questions... There will be similiar problems to these and I just need to see the approach taken... Thanks again
• September 26th 2010, 09:11 AM
Traveller
Does it work out to be $\lfloor \frac{m+1}{2} \rfloor$ ?