×

The Fibonacci numbers via trigonometric expressions. (English) Zbl 0298.05104


MSC:

05C05 Trees
05C30 Enumeration in graph theory
11B37 Recurrences
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Moon, J.W., Counting labelled trees, Can. mathematical mono., (1970), Can. Math. Congress, No. 1 · Zbl 0214.23204
[2] Bouwkamp, C.J., Solution to problem 63-14, a resistance problem, SIAM rev., Vol. 7, 286-290, (April 1965)
[3] Bedrosian, S.D., Number of spanning trees in multigraph wheels, IEEE trans. circuit theory, Vol. CT-19, 77-78, (Jan. 1972)
[4] Bedrosian, S.D., Generating formulas for the number of trees in a graph, J. franklin inst., Vol. 277, 313-326, (April 1964)
[5] Bercovici, M., Formulas for the number of trees in a graph, IEEE trans. circuit theory, Vol. CT-13, 101-102, (Feb. 1969)
[6] Bedrosian, S.D., Formulas for the number of trees in certain incomplete graphs, J. franklin inst., Vol. 289, 67-69, (Jan. 1970)
[7] Myers, B.R., Number of spanning trees in a wheel, IEEE trans. circuit theory, Vol. CT-18, 280-281, (March 1971)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.