Table of Contents
ISRN Discrete Mathematics
Volume 2014 (2014), Article ID 132925, 3 pages
http://dx.doi.org/10.1155/2014/132925
Research Article

A Note on Closed-Form Representation of Fibonacci Numbers Using Fibonacci Trees

School of Information Technology and Engineering, VIT University, Vellore 632014, India

Received 7 November 2013; Accepted 22 December 2013; Published 12 February 2014

Academic Editors: M. Kano and X. Zhang

Copyright © 2014 Indhumathi Raman. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. G. M. Adelson-Velskii and E. M. Landis, “An algorithm for organization of information,” Soviet Mathematics. Doklady, vol. 3, pp. 1259–1262, 1962. View at Google Scholar
  2. S. G. Wagner, “The Fibonacci number of Fibonacci trees and a related family of polynomial recurrence systems,” Fibonacci Quarterly, vol. 45, no. 3, pp. 247–253, 2007. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. Y. Horibe, “Notes on Fibonacci trees and their optimality,” The Fibonacci Quaterly, vol. 21, no. 2, pp. 118–128, 1983. View at Google Scholar
  4. N. Jia and K. W. McLaughlin, “Fibonacci trees: A study of the asymptotic behavior of Balaban's index,” MATCH. Communications in Mathematical and in Computer Chemistry, no. 51, pp. 79–95, 2004. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. R. M. Capocelli, “A note on Fibonacci trees and the Zeckendorf representation of integers,” The Fibonacci Quarterly, vol. 26, no. 4, pp. 318–324, 1988. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. W. Eric, “Binet's Fibonacci Number Formula,” from MathWorld.