Spanning Trees of the Complete Bipartite Graph

Nora Hartsfield; J. S. Werth

doi:10.1007/978-3-642-46908-4_38

ScienceGate Book Chapters

BOOK-CHAPTER

Spanning Trees of the Complete Bipartite Graph

Nora Hartsfield J. S. Werth

Year: 1990 Pages: 339-346

DOI: 10.1007/978-3-642-46908-4_38

Get Full-Text PDF Get Analytical Report

Abstract

A new proof that the number of spanning trees of K m,n is m n−1 n m−1 is presented. The proof is similar to Prüfer's proof of Cayley's formula for the number of spanning trees of K n .

Keywords:

Spanning tree Combinatorics Bipartite graph Mathematics Combinatorial proof Cayley graph Graph Discrete mathematics

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.24

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Spanning Trees of the Complete Bipartite Graph

Abstract

Metrics

Citation History

Topics

Related Documents

Counting spanning trees in a complete bipartite graph which contain a given spanning forest

Effective resistances and spanning trees in the complete bipartite graph plus a matching

Some Applications of Spanning Trees in Complete and Complete Bipartite Graphs

Spanning trees in complete bipartite graphs and resistance distance in\n nearly complete bipartite graphs

Spanning trees of descendants of a complete graph