Reachability in complete t-ary trees
Annals of Mathematics and Computer Science · 2023
DOI: 10.56947/amcs.v18.191 ↗Kurz gefasst
Fachartikel in der Zeitschrift Annals of Mathematics and Computer Science, 2023. Verfasst von Sylvester Arthur Abayo und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Abayo, S. A., Okoth, I. O., & Kasyoki, D. M. (2023). Reachability in complete t-ary trees. Annals of Mathematics and Computer Science. https://doi.org/10.56947/amcs.v18.191
Vancouver
Abayo SA, Okoth IO, Kasyoki DM. Reachability in complete t-ary trees. Annals of Mathematics and Computer Science. 2023. doi:10.56947/amcs.v18.191
BibTeX
@article{Abayo2023,
author = {Abayo, Sylvester Arthur and Okoth, Isaac Owino and Kasyoki, Donnie Munyao},
title = {Reachability in complete t-ary trees},
journal = {Annals of Mathematics and Computer Science},
year = {2023},
doi = {10.56947/amcs.v18.191}
}
EUVIMED