EUVIMEDEUVIMED entdecken
Crossref

Marked noncrossing trees

Albert Oloo Nyariaro, Isaac Owino Okoth, Fredrick Oluoch Nyamwala

Journal of Combinatorial Mathematics and Combinatorial Computing · 22.07.2026 · 131 · 67-86

DOI: 10.61091/jcmcc131-05 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 22.07.2026. Verfasst von Albert Oloo Nyariaro und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The enumeration of noncrossing trees has attracted significant attention since the turn of 21st century. These trees have been studied with respect to various statistics, including the number of vertices, leaves, root degree, and levels. In contrast, plane trees have a longer history of exploration. In 2010, Deutsch and his co-authors introduced and enumerated a class of plane trees in which a rightmost edge may be marked, provided it does not lead to a leaf. Their enumeration formula involved the Catalan numbers, which also count plane trees. In this work, we extend the concept of marking rightmost edges to noncrossing trees, introducing a new combinatorial structure. We enumerate this structure according to the number of edges, marked edges, root degree, and leaves. We use symbolic method and Lagrange Inversion Formula to derive our results. Furthermore, we establish connections between these new structures and both labelled plane trees and ternary trees.

Zitieren

APA

Nyariaro, A. O., Okoth, I. O., & Nyamwala, F. O. (2026). Marked noncrossing trees. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 67-86. https://doi.org/10.61091/jcmcc131-05

Vancouver

Nyariaro AO, Okoth IO, Nyamwala FO. Marked noncrossing trees. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;131:67-86. doi:10.61091/jcmcc131-05

BibTeX
@article{Nyariaro2026,
  author = {Nyariaro, Albert Oloo and Okoth, Isaac Owino and Nyamwala, Fredrick Oluoch},
  title = {Marked noncrossing trees},
  journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
  year = {2026},
  volume = {131},
  pages = {67--86},
  doi = {10.61091/jcmcc131-05}
}
Kostenlos starten →