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:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1993
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16112 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |