TY - JOUR
T1 - Enumerations of ordered trees
AU - Dershowitz, Nachum
AU - Zaks, Shmuel
N1 - Funding Information:
* Research supported under NSF Grant MCS77-22830. ** Present address: Department of Cumputer Science, Technion, Haifa Israel
PY - 1980
Y1 - 1980
N2 - We deal with the class Tn of ordered trees with n edges. Several enumeration problems concerning Tn and some of its combinatorial properties are studied. Closed-form expressions for the following enumerations are given: (1) the number of trees in Tn with k leaves, (2) the number of nodes in Tn with d children, (3) the number of trees in Tn with root degree r, and (4) the number of nodes in Tn on level l with d children.
AB - We deal with the class Tn of ordered trees with n edges. Several enumeration problems concerning Tn and some of its combinatorial properties are studied. Closed-form expressions for the following enumerations are given: (1) the number of trees in Tn with k leaves, (2) the number of nodes in Tn with d children, (3) the number of trees in Tn with root degree r, and (4) the number of nodes in Tn on level l with d children.
UR - http://www.scopus.com/inward/record.url?scp=0001875877&partnerID=8YFLogxK
U2 - 10.1016/0012-365X(80)90168-5
DO - 10.1016/0012-365X(80)90168-5
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0001875877
SN - 0012-365X
VL - 31
SP - 9
EP - 28
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1
ER -