Refined enumeration of vertices among all rooted ordered $d$-trees

Abstract

In this paper we enumerate the cardinalities for the set of all vertices of outdegree $\ge k$ at level $\ge \ell$ among all rooted ordered $d$-trees with $n$ edges. Our results unite and generalize several previous works in the literature.

10 pages, 6 figures, 1 table