Abstract
We give a formula for the number of spanning trees in a chain of cycles that have connected intersection of one edge but where the cycles have variable sizes. The formula uses basic properties of continued fractions.
Keywords
Publication details
- DOI
- 10.24200/squjs.vol15iss0pp81-86
- Journal
- Sultan Qaboos University Journal for Science, 15, 81
- Publisher
- Sultan Qaboos University
- Open access
- Gold open access
- License
- CC BY 4.0
Cite this article
APA 7
Bier, T. (2010). Formulas for the Number of Spanning Trees in a Chain of Cycles. Sultan Qaboos University Journal for Science, 15, 81. https://doi.org/10.24200/squjs.vol15iss0pp81-86
MLA 9
Bier, Thomas. "Formulas for the Number of Spanning Trees in a Chain of Cycles." Sultan Qaboos University Journal for Science, vol. 15, 2010, pp. 81. https://doi.org/10.24200/squjs.vol15iss0pp81-86.
Chicago (author–date)
Bier, Thomas. 2010. "Formulas for the Number of Spanning Trees in a Chain of Cycles." Sultan Qaboos University Journal for Science 15: 81. https://doi.org/10.24200/squjs.vol15iss0pp81-86.
Harvard
Bier, T. (2010) 'Formulas for the Number of Spanning Trees in a Chain of Cycles', Sultan Qaboos University Journal for Science, 15, pp. 81. doi:10.24200/squjs.vol15iss0pp81-86.
Vancouver
Bier T. Formulas for the Number of Spanning Trees in a Chain of Cycles. Sultan Qaboos University Journal for Science. 2010;15:81. doi:10.24200/squjs.vol15iss0pp81-86
IEEE
T. Bier, "Formulas for the Number of Spanning Trees in a Chain of Cycles," Sultan Qaboos University Journal for Science, vol. 15, pp. 81, 2010, doi: 10.24200/squjs.vol15iss0pp81-86.