An investigation of fibonacci trees
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 a...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
1993
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/16112 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |
| 語言: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-16625 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-166252021-11-13T03:54:02Z An investigation of fibonacci trees Her, Hye Yoon 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. 1993-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/16112 Bachelor's Theses English Animo Repository Fibonnaci numbers Trees (Graph theory) |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Fibonnaci numbers Trees (Graph theory) |
| spellingShingle |
Fibonnaci numbers Trees (Graph theory) Her, Hye Yoon An investigation of fibonacci trees |
| description |
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. |
| format |
text |
| author |
Her, Hye Yoon |
| author_facet |
Her, Hye Yoon |
| author_sort |
Her, Hye Yoon |
| title |
An investigation of fibonacci trees |
| title_short |
An investigation of fibonacci trees |
| title_full |
An investigation of fibonacci trees |
| title_fullStr |
An investigation of fibonacci trees |
| title_full_unstemmed |
An investigation of fibonacci trees |
| title_sort |
investigation of fibonacci trees |
| publisher |
Animo Repository |
| publishDate |
1993 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/16112 |
| _version_ |
1772835020455542784 |