[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.4134/BKMS.2014.51.1.229

HYBRID d-ARY TREES AND THEIR GENERALIZATION

Hong, SeoungJi (Department of Mathematics Yonsei University)
Park, SeungKyung (Department of Mathematics Yonsei University)

Publication Information

Bulletin of the Korean Mathematical Society / v.51, no.1, 2014 , pp. 229-235 More about this Journal

Abstract

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

Keywords

enumeration; generating function; hybrid tree;

Citations & Related Records

Reference

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