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 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|