Reachability in complete t-ary trees
Keywords:complete t-ary tree, path length, sink, leaf sink, leftmost path, first child, non-first child
Mathematical trees such as Cayley trees, plane trees, binary trees, noncrossing trees, t-ary trees among others have been studied extensively. Reachability of vertices as a statistic has been studied in Cayley trees, plane trees, noncrossing trees and recently in t-ary trees where all edges are oriented from vertices of lower label towards vertices of higher label. In this paper, we obtain closed formulas as well as asymptotic formulas for the number of complete t-ary trees in which there are paths of a given length such that the terminal vertex is a sink, leaf sink, first child and non-first child. We also obtain number of trees in which there is a leftmost path of a given length.
Copyright (c) 2023 Annals of Mathematics and Computer Science
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.