Elsevier

Discrete Mathematics

Volumes 197–198, 28 February 1999, Pages 537-541
Discrete Mathematics

Contribution
The number of spanning trees of a complete multipartite graph

https://doi.org/10.1016/S0012-365X(99)90111-5Get rights and content
Under an Elsevier user license
open archive

Abstract

We calculate the number of spanning trees of a complete multipartite graph, using a ‘Prüfer sequence’ argument, and we use this approach to determine the distribution of the vertices of given degree among all the spanning trees.

Keywords

Complete multipartite graph
Bijection
Asymptotic probability
Expected degree

Cited by (0)