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...
Saved in:
Published in | Communications in Advanced Mathematical Sciences Vol. 4; no. 2; pp. 75 - 88 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Emrah Evren KARA
30.06.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!