OFFSET
1,2
COMMENTS
Number of spanning trees in the bipartite graph K(n,n). In general the number of spanning trees in the bipartite graph K(m,n) is m^(n-1) * n^(m-1).
LINKS
Eric Weisstein's World of Mathematics, Complete Bipartite Graph
Eric Weisstein's World of Mathematics, Spanning Tree
PROG
(PARI) a(n)=n^(2*n-2) \\ Charles R Greathouse IV, Mar 31 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Sharon Sela (sharonsela(AT)hotmail.com), May 06 2002
STATUS
approved