dc.contributor.author | Isaac Owino Okoth, Albert Oloo Nyariaro | |
dc.date.accessioned | 2022-01-24T09:42:10Z | |
dc.date.available | 2022-01-24T09:42:10Z | |
dc.date.issued | 2021 | |
dc.identifier.uri | https://repository.maseno.ac.ke/handle/123456789/4621 | |
dc.description.abstract | In this paper, we prove some new formulas in the enumeration of labelled t-ary trees by path
lengths. We treat trees having their edges oriented from a vertex of lower label towards a vertex of higher
label. Among other results, we obtain counting formulas for the number of t-ary trees on n vertices in which
there are paths of length ` starting at a root with label i and ending at a vertex, sink, leaf sink, first child,
non-first child and non-leaf. For each statistic, the average number of these reachable vertices is obtained for
any random t-ary tree. | en_US |
dc.publisher | Open Journal of Mathematical Sciences | en_US |
dc.subject | t-ary trees; Reachability; Leaf; Sink; First child | en_US |
dc.title | Reachability results in labelled t-ary trees | en_US |
dc.type | Article | en_US |