Title of article
The number of spanning trees of a complete multipartite graph Original Research Article
Author/Authors
Richard P. Lewis، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
5
From page
537
To page
541
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 , Asymptotic probability , Expected degree , Bijection
Journal title
Discrete Mathematics
Serial Year
1999
Journal title
Discrete Mathematics
Record number
950731
Link To Document