SOME ENUMERATION PROBLEMS ON t-ARY TREES AND ORDERED TREES
,
SUN CHAO-YI
Author information+
Wuhan Digital Engineering Institute
{{custom_zuoZheDiZhi}}
{{custom_authorNodes}}
{{custom_bio.content}}
{{custom_bio.content}}
{{custom_authorNodes}}
Collapse
History+
Received
Revised
Published
1900-01-01
1900-01-01
1987-01-25
Issue Date
1987-01-25
Abstract
Several formulae are established to calculate (i) the number of trees in the class Γ(t;n,n_(e_0),…,n_(e_p)) of t-ary trees with n_(e_0) nodes of degree e_0,n_(e_1) nodes of degree e_1,…,n_(e_p) nodes of degree e_p and n-(n_(e_0)+…+n_(e_p))nodes of other degrees,(ii) the numberof trees in F(t;n,n_(e_0),…,n_(e_p))with root node of degree r,(iii) the number of trees in the class \Omega(n,n_(e_0),…,n_(e_p)) of ordered trees with the same node restrication as (1),and (iv) the number of trees in \Omega(n,n_(e_0),…,n_(e_p)) with root node of degree r.
SUN CHAO-YI. , {{custom_author.name_en}}.
SOME ENUMERATION PROBLEMS ON t-ARY TREES AND ORDERED TREES. Journal of Systems Science and Mathematical Sciences, 1987, 7(1): 72-077 https://doi.org/10.12341/jssms08804
PDF(211 KB)
