2000 character limit reached
About Fibonacci trees. I (1904.12135v1)
Published 27 Apr 2019 in cs.FL and cs.DM
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.