论文信息 - Forests of labeled trees

Forests of labeled trees

Abstract Forests of labeled trees, rooted or not, oriented or not, are enumerated by number of (labeled) points and by number of trees for unrestricted and various restricted heights.

John Riordan | J. Riordan

[1] G. Pólya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .

[2] John Riordan,et al. Enumeration of Linear Graphs for Mappings of Finite Sets , 1962 .

[3] John Riordan,et al. The Enumeration of Trees by Height and Diameter , 1960, IBM J. Res. Dev..

[4] E. Gilbert. Enumeration Of Labelled Graphs , 1956, Canadian Journal of Mathematics.

[5] John Riordan,et al. Inverse Relations and Combinatorial Identities , 1964 .

[6] L. Carlitz. Some congruences for the Bell polynomials. , 1961 .