Reachability Results in Plane Trees

In this paper, we obtain closed formulas for the number of reachable vertices in labelled plane trees by paths lengths, sinks, leaf sinks, first children, left most path, non-first children, and non-leaves. Our counting objects are plane trees having their edges oriented from a vertex of lower label...

Full description

Saved in:
Bibliographic Details
Published inCommunications in Advanced Mathematical Sciences Vol. 4; no. 2; pp. 75 - 88
Main Authors Isaac Owino Okoth, Albert Nyariaro
Format Journal Article
LanguageEnglish
Published Emrah Evren KARA 30.06.2021
Subjects
leaf
plane tree
sink
Online AccessGet full text

Cover

More Information
Summary:In this paper, we obtain closed formulas for the number of reachable vertices in labelled plane trees by paths lengths, sinks, leaf sinks, first children, left most path, non-first children, and non-leaves. Our counting objects are plane trees having their edges oriented from a vertex of lower label towards a vertex of higher label. For each statistic, we obtain the average number of reachable vertices. Moreover, we obtain a counting formula for the number of plane trees on $n$ vertices such that exactly $k\leq n$ are reachable from the root.
ISSN:2651-4001
DOI:10.33434/cams.936558