Ordered trees with prescribed root degrees, node degrees, and branch lengths

A new decomposition of ordered trees is introduced. It turns out to be very convenient for finding multivariate generating functions according to branch related statistics. Same decomposition is used to enumerate, according to size, trees that have prescribed sets of root degrees, node degrees, and branch lengths.

[1]  Marc Noy,et al.  Diagonally convex directed polyominoes and even trees: a bijection and related issues , 2002, Discret. Math..

[2]  Philippe Flajolet,et al.  An introduction to the analysis of algorithms , 1995 .

[3]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .

[4]  Emeric Deutsch,et al.  Dyck paths : generalities and terminology , 2003 .

[5]  Emeric Deutsch,et al.  A survey of the Fine numbers , 2001, Discret. Math..

[6]  R. Stanley,et al.  Enumerative Combinatorics: Index , 1999 .

[7]  Robert Donaghey,et al.  Restricted plane tree representations of four Motzkin-Catalan equations , 1977, J. Comb. Theory, Ser. B.

[8]  Ian Anderson.  A first course in discrete mathematics , 2001, Springer undergraduate mathematics series.

[9]  M. Aigner,et al.  Motzkin Numbers , 1998, Eur. J. Comb..

[10]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[11]  D. Klarner,et al.  Correspondences between plane trees and binary sequences , 1970 .

[12]  Chuan Yi Tang,et al.  A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem , 1993, Inf. Process. Lett..

[13]  Emeric Deutsch,et al.  A bijection between ordered trees and 2-Motzkin paths and its many consequences , 2002, Discret. Math..

[14]  John Riordan,et al.  Enumeration of Plane Trees by Branches and Endpoints , 1975, J. Comb. Theory, Ser. A.

[15]  Renzo Sprugnoli,et al.  The Motzkin family , 1992 .

[16]  D. White,et al.  Constructive combinatorics , 1986 .

[17]  Frank R. Bernhart.  Catalan, Motzkin, and Riordan numbers , 1999, Discret. Math..