Enumerations of vertices among all rooted ordered trees with levels and degrees

Sen-Peng Eu, Seunghyun Seo, Heesung Shin

研究成果: 雜誌貢獻文章

2 引文 斯高帕斯(Scopus)

摘要

In this paper we enumerate and give bijections for the following four sets of vertices among rooted ordered trees of a fixed size: (i) first-children of degree k at level ℓ, (ii) non-first-children of degree k at level ℓ−1, (iii) leaves having k−1 elder siblings at level ℓ, and (iv) non-leaves of outdegree k at level ℓ−1. Our results unite and generalize several previous works in the literature.

原文英語
頁(從 - 到)2123-2129
頁數7
期刊Discrete Mathematics
340
發行號9
DOIs
出版狀態已發佈 - 2017 九月 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

指紋 深入研究「Enumerations of vertices among all rooted ordered trees with levels and degrees」主題。共同形成了獨特的指紋。

  • 引用此