On Spanning Trees, Weighted Compositions, Fibonacci Numbers, and Resistor Networks
Author:
- B. R. MyersBMB. R. Myers
- 1 July 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 17 (3) , 465-474
Abstract
Techniques for enumerating the spanning trees of graphs and multigraphs are presented which involve weighted sums of the spanning forests of certain subgraphs and which both borrow from and contribute to the theories of weighted compositions and Fibonacci numbers, with supplemental reference to electrical resistor network concepts.Keywords
This publication has 2 references indexed in Scilit:
- GRAPH THEORY1969
- Compositions and Fibonacci NumbersThe Fibonacci Quarterly, 1969