Reachability Results in Plane Trees
Abstract
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.
Keywords
Plane tree , Leaf , Sink
References
- [1] R. R. X. Du, J .Yin. Countinglabelledtreeswithagivenindegreesequence. J.Combin.Theory,Ser.A,117(3)(2010),345– 353.
- [2] I. O. Okoth. Combinatorics of oriented trees and tree-like structures. PhD Thesis, Stellenbosch University, (2015).
- [3] I. O. Okoth, A. O. Nyariaro. Reachability results in labelled t-ary trees. Preprint, (2021).
- [4] S. Seo, H. Shin. On the enumeration of rooted trees with fixed size of maximal decreasing trees. Discrete Math.,312(2) (2012), 419–426.
- [5] H. S. Wilf. Generatingfunctionology. A. K. Peters, Ltd., Natick, MA, USA, (2006).
