Leaf-induced subtrees of leaf-Fibonacci trees

Abstract: In analogy to a concept of Fibonacci trees, we define the leaf-Fibonacci tree of size

n

and investigate its number of nonisomorphic leaf-induced subtrees. Denote by

f_{0}

the one vertex tree and

f_{1}

the tree that consists of a root with two leaves attached to it; the leaf-Fibonacci tree

f_{n}

of size

n g e q 2

is the binary tree whose branches are

f_{n - 1}

and

f_{n - 2}

. We derive a nonlinear difference equation for the number

e x t N (f_{n})

of nonisomorphic leaf-induced subtrees (subtrees induced by leaves) of

f_{n}

, and also prove that

e x t N (f_{n})

is asymptotic to

1.00001887227319 l d o t s (1.48369689570172 l d o t s)^{p h i^{n}}

(

p h i =

~golden ratio) as

n

grows to infinity.

Recommendations

Cites work

Cited in

(6)

Describes a project that uses

Uses Software

This page was built for publication: Leaf-induced subtrees of leaf-Fibonacci trees