No label defined (Q4028241)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 139901
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 139901

      Statements

      0 references
      28 March 1993
      0 references
      rooted binary tree
      0 references
      leaves
      0 references
      interval nodes
      0 references
      Fibonacci tree
      0 references
      [For the entire collection see Zbl 0747.00035.] For \(n\in\mathbb{Z}^ +\) the Fibonacci trees \(T_ 1,T_ 2,T_ 3,\dots,\) are defined recursively as follows: (i) \(T_ 1\) and \(T_ 2\) are trees with only one vertex --- the root; and, (ii) If \(n\geq 3\), \(T_ n\) is the rooted binary tree where \(T_{n-1}\) is the left subtree and \(T_{n-2}\) is the right subtree. In this paper we shall be primarily interested in how the leaves and interval nodes are distributed throughout the levels of a given Fibonacci tree \(T_ n\). For \(n\in\mathbb{Z}^ +\) and \(i\in\mathbb{N}\), we let \(I(n,i)\) denote the number of internal nodes in \(T_ n\) at level \(i\). (The root of \(T_ n\) is at level 0, its children are at level 1, its grandchildren at level 2, and so on.) The number of leaves in \(T_ n\) at level \(i\) is denoted by \(L(n,i)\). Identities involving the numbers \(I(n,i)\) and \(L(n,i)\) are derived as part of our investigation.
      0 references

      Identifiers