An investigation of fibonacci trees
Date of Publication
1993
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
A tree is said to be a Fibonacci tree if all the vertices can be labelled with n Fibonacci numbers such that the set of differences of any two adjacent vertices will again consist of the first (n-l) Fibonacci numbers.Fibonacci numbers u1, u2, ... are defined recursively by the equation u1 = u2 = 1 and un = un-1 + un-2 + un-2 for n 3.This study is based on two articles Fibonacci Trees by Koh Khee Meng, Lee Peng Yee and Tan Tay and A Characterization of Fibonacci Trees by Onn Chan and C. C. Chen. This study provides an introduction to the concept of Fibonacci tree. It also gives the proofs of the theorem on the number of Fibonacci trees of order n and a characterization of Fibonacci trees in terms of formal language.
Abstract Format
html
Language
English
Format
Accession Number
TU06223
Shelf Location
Archives, The Learning Commons, 12F Henry Sy Sr. Hall
Physical Description
60 leaves
Keywords
Fibonnaci numbers; Trees (Graph theory)
Recommended Citation
Her, H. Y. (1993). An investigation of fibonacci trees. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16112
