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

HYBRID d-ARY TREES AND THEIR GENERALIZATION

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

We enumerate black and white colored d-ary trees with no leftmost -edges, which is a generalization of hybrid binary trees. Then the multi-colored hybrid d-ary trees with the same condition is studied.

Abstract

We enumerate black and white colored d-ary trees with no leftmost -edges, which is a generalization of hybrid binary trees. Then the multi-colored hybrid d-ary trees with the same condition is studied.

참고문헌 (6)

  1. N. Gu, "2-Binary trees: Bijections and related issues", Discrete Math, 308(7), pp.1209~1221 (2008)
  2. N. Gu, "Bijections for 2-plane trees and ternary trees", European J. Combin, 30(4), pp.969~985 (2009)
  3. J. Pallo, "On the listing and random generation of hybrid binary trees", Int. J. Computer Math, 50, pp.135~145 (1994)
  4. A. Panholzer, "Bijections between certain families of labelled and unla-belled d-ary trees", Appl. Anal. Discrete Math, 3(1), pp.123~136 (2009)
  5. R. P. Stanley, "Enumerative Combinatorics. Vol. 2" (1999), Cambridge University Press
  6. S. Yan, "2-noncrossing trees and 5-ary trees", Discrete Math, 309(20), pp.6135~6138 (2009)

관련 논문AI추천

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