About Fibonacci trees. I
classification
💻 cs.FL
cs.DM
keywords
treefibonaccinodepropertiesrootedstillanswerarise
read the original abstract
In this first paper, we look at the following question: are the properties of the Fibonacci tree still true if we consider a finitely generated tree by the same rules but rooted at a black node? The direct answer is no, but new properties arise, a bit more complex than in the case of a tree rooted at a white node, but still of interest.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.