The enumeration of labelled spanning trees of Km, n

Using a bijection to decompose a labelled rooted bipartite tree into several ones with smaller size and their exponential generating functions, this paper concerns the number of labelled spanning trees of the complete bipartite graph K m,n .

[1]  L. E. Clarke.  On Cayley's Formula for Counting Trees , 1958 .

[2]  W Y Chen,et al.  A general bijective algorithm for trees. , 1990, Proceedings of the National Academy of Sciences of the United States of America.

[3]  T. Austin,et al.  The Enumeration of Point Labelled Chromatic Graphs and Trees , 1960, Canadian Journal of Mathematics.

[4]  Moh'd Z. Abu-Sbeih.  On the number of spanning trees of Kn and Km, n , 1990, Discret. Math..

[5]  Jiang Zeng.  A Ramanujan Sequence that Refines the Cayley Formula for Trees , 1999 .

[6]  H. I. Scoins,et al.  The number of trees with nodes of alternate parity , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  Peter W. Shor,et al.  A New Proof of Cayley's Formula for Counting Labeled Trees , 1995, J. Comb. Theory, Ser. A.