The Fibonacci numbers via trigonometric expressions
From MaRDI portal
Publication:1214423
DOI10.1016/0016-0032(73)90227-5zbMath0298.05104OpenAlexW2044290684MaRDI QIDQ1214423
Publication date: 1973
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(73)90227-5
Related Items (8)
Further analysis of the number of spanning trees in circulant graphs ⋮ Coding and counting spanning trees in Kleitman-Golden graphs ⋮ Cycles and spanning trees ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs ⋮ Generating formulas for the number of trees in a graph ⋮ Chebyshev polynomials and spanning tree formulas for circulant and related graphs ⋮ On generic forms of complementary graphs ⋮ Counting spanning trees in the graphs of Kleitman and Golden and a generalization
Cites Work
This page was built for publication: The Fibonacci numbers via trigonometric expressions
