Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
