Skip to main content
Book Chapter

Spanning Trees of the Complete Bipartite Graph

  • Hartsfield N
  • Werth J
Physica-Verlag HD, (1990), 339-346
DOI: 10.1007/978-3-642-46908-4_38
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new proof that the number of spanning trees of [(m,n is mn-1n m-1 is presented. The proof is similar to Priifer's proof of Cayley's formula for the number of spanning trees of [(n.

Cite

CITATION STYLE

APA

Hartsfield, N., & Werth, J. S. (1990). Spanning Trees of the Complete Bipartite Graph. In Topics in Combinatorics and Graph Theory (pp. 339–346). Physica-Verlag HD. https://doi.org/10.1007/978-3-642-46908-4_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free