Abstract
Continuing a previous paper [2], a certain asymptotically maximal property of the Fibonacci tree in the class of the self-similar binary trees will be shown, beginning with a review of the relevant parts of [2] in the next section.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Horibe, Y. “An Entropy View of Fibonacci Trees.” The Fibonacci Quarterly, Vol. 20 (1982): pp. 168–178.
Horibe, Y. “Growing a Self-Similar Tree.” Applications of Fibonacci Numbers, Volume 7. Edited by G.E. Bergum, A.F. Horadam and A.N. Philippou. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998: pp. 177–184.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Horibe, Y. (1999). On an Asymptotic Maximality of the Fibonacci Tree. In: Howard, F.T. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4271-7_19
Download citation
DOI: https://doi.org/10.1007/978-94-011-4271-7_19
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5851-3
Online ISBN: 978-94-011-4271-7
eBook Packages: Springer Book Archive