Note on the exponential recursive k-ary trees
M Ghasemi, M Javanian, RI Nabiyyi - RAIRO-Theoretical Informatics …, 2023 - rairo-ita.org
In the present paper, we consider exponential recursive trees with no node of outdegree
greater than k, called exponential recursive k-ary trees (k≥ 2). At each step of growing of …
greater than k, called exponential recursive k-ary trees (k≥ 2). At each step of growing of …
[PDF][PDF] Mina Ghasemi1, Mehri Javanian2, and Ramin Imany Nabiyyi1
ARY TREES - academia.edu
In the present paper, we consider exponential recursive trees with no node of outdegree
greater than k, called exponential recursive k-ary trees (k≥ 2). At each step of growing of …
greater than k, called exponential recursive k-ary trees (k≥ 2). At each step of growing of …