Question

The number of spanning trees in the graph \[K_{2,n}= n*2^{n-1}\]

spanning tree def and example http://prntscr.com/91utcp
K_{2,n} is a bi-partite 2,n vertex graph
prove it,

Answer 1

i dun knw what this means-K_(2,n)= n*2^(n-1)