Number of Spanning Trees in Multigraph Wheels
- 1 January 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 19 (1) , 77-78
- https://doi.org/10.1109/tct.1972.1083410
Abstract
Taking the graph called the wheelW_{n}as the join ofK_{1}andC_{n}, we consider it along with three multigraph variations. A recursion formula for the number of spanning trees inW_{n}, T_{n} = 3T_{n-1}-T_{n-2} + 2, and other pertinent formulas are presented. A related resistance network problem is also discussed briefly.Keywords
This publication has 4 references indexed in Scilit:
- Number of spanning trees in a wheelIEEE Transactions on Circuit Theory, 1971
- A Resistance Problem, by Ron L. GrahamSIAM Review, 1965
- Generating formulas for the number of trees in a graphJournal of the Franklin Institute, 1964
- A Resistance ProblemSIAM Review, 1963