본문 바로가기
KERD
논문KCI 등재

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

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

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.

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.

참고문헌 (6)

  1. L. W. Beineke, "The number of labeled k-dimensional trees", J. Combi-natorial Theory, 6, pp.200~205 (1969)
  2. Miklós Bóna, "Enumeration of m-Ary Cacti", Advances in Applied Mathematics, 24(1), pp.22~56 (2000), Elsevier BV[DOI]
  3. Sen-Peng Eu, "Enumerations of vertices among all rooted ordered trees with levels and degrees", Discrete Mathematics, 340(9), pp.2123~2129 (2017), Elsevier BV[DOI]
  4. F. Harary, "On the Number of Husimi Trees: I", Proceedings of the National Academy of Sciences, 39(4), pp.315~322 (1953), Proceedings of the National Academy of Sciences[DOI]
  5. Mahendra Jani, "Enumeration of K-Trees and Applications", Annals of Combinatorics, 6(3), pp.375~382 (2002), Springer Science and Business Media LLC[DOI]
  6. S. Seo, "Two involutions on vertices of ordered trees. I", 14st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2002) (2002)

관련 논문AI추천

이 간행물의 다른 논문 (17건)