@article{Article_91,

title = {Counting vertices among all noncrossing trees by levels and degrees},

journal = {Communications in Combinatorics, Cryptography & Computer Science},

volume = {2024},

issue = {2},

issn = { 2783-5456 },

year = {2024},

url = {http://cccs.sgh.ac.ir/Articles/2024/issue 2/2-7-Countingverticesamongallnoncrossingtreesbylevelsanddegrees.pdf},

author = {Fidel Ochieng Oduol and Isaac Owino Okoth},

keywords = {Noncrossing tree, level, degree, eldest child, first child, non-first child, leaf, non-leaf.},

abstract = {In this paper, we enumerate vertices among all noncrossing trees based on their levels and degrees. Moreover, we obtain the number of eldest children, first children, non-first children, leaves and non-leaves which reside at a given level. We use generating functions, butterfly decomposition of noncrossing trees and bijections to arrive at our results.}

};