|
|||||
 |
|
|
|
|
|
|
|
Spanning trees
of descendants of a complete graph
Derya Asaner, Sayonita Ghosh Hajra and Maryam Siddique
Vol. 15 (2022), No. 3, 475–488
|
Abstract |
|
We study the spanning trees of descendants of a complete graph. We provide three different proofs, based on linear algebra, for computing the number of spanning trees. Our result generalizes an old result of Weinberg that computes the number of spanning trees of a particular descendant of a complete graph. |
PDF Access Denied
We have not been able to recognize your IP address
18.221.129.145
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for USD 30.00:
Keywords
complete graph, spanning trees, Weinberg formula
|
Mathematical Subject Classification
Primary: 05C30
|
Milestones
Received: 18 July 2021
Revised: 16 October 2021
Accepted: 27 November 2021
Published: 2 December 2022
Communicated by Kenneth S. Berenhaut
|
Authors |
| Derya Asaner | |
| Department of Mathematics and
Statistics California State University Sacramento, CA United States |
|
| Sayonita Ghosh Hajra | |
| Department of Mathematics and
Statistics California State University Sacramento, CA United States |
|
| Maryam Siddique | |
| Department of Mathematics and
Statistics California State University Sacramento, CA United States |
|
