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

A REFINED ENUMERATION OF p-ARY LABELED TREES

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

Let Tn(p) be the set of p-ary labeled trees on {1, 2, . . . , n}. A maximal decreasing subtree of an p-ary labeled tree is de ned bythe maximal p-ary subtree from the root with all edges being de-creasing. In this paper, we study a new re nement Tn,k(p)n of Tn(p),which is the set of p-ary labeled trees whose maximal decreasingsubtree has k vertices.

Abstract

Let Tn(p) be the set of p-ary labeled trees on {1, 2, . . . , n}. A maximal decreasing subtree of an p-ary labeled tree is de ned bythe maximal p-ary subtree from the root with all edges being de-creasing. In this paper, we study a new re nement Tn,k(p)n of Tn(p),which is the set of p-ary labeled trees whose maximal decreasingsubtree has k vertices.

참고문헌 (6)

  1. Francois Bergeron, "Philippe Flajolet, and Bruno Salvy, Varieties of increasing trees, In CAAP '92 (Rennes, 1992)", Lecture Notes in Comput. Sci., 581, pp.24~48 (1992), Springer
  2. Ronald L. Graham, "Concrete mathematics, In A foundation for computer science" (1989), Addison-Wesley Publishing Company Advanced Book Program
  3. Seunghyun Seo, "A generalized enumeration of labeled trees and reverse Prufer algorithm", J. Combin. Theory Ser. A, 114(7), pp.1357~1361 (2007)
  4. Seunghyun Seo, "On the enumeration of rooted trees with fixed size of maximal decreasing trees", Discrete Math, 312(2), pp.419~426 (2012)
  5. 서승현, "A refinement for ordered labeled trees", 한국수학논문집, 20(2), pp.255~261 (2012), 강원경기수학회[DOI]
  6. Richard P. Stanley, "Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics" (1999), Cambridge University Press, Cam- bridge

관련 논문AI추천

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