The enumeration of rooted trees by total height
暂无分享,去创建一个
[1] Leo Katz,et al. Probability of Indecomposability of a Random Mapping Function , 1955 .
[2] G. Pólya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .
[3] R. E. Fagen,et al. The Number of Components in Random Linear Graphs , 1959 .
[4] John Riordan,et al. The Enumeration of Trees by Height and Diameter , 1960, IBM J. Res. Dev..
[5] A. Hurwitz,et al. Über Abel's Verallgemeinerung der binomischen Formel , 1902 .
[6] John Riordan,et al. Introduction to Combinatorial Analysis , 1959 .
[7] A. Rényi,et al. On the height of trees , 1967, Journal of the Australian Mathematical Society.
[8] G. N. Watson. Theorems Stated by Ramanujan (V): Appronimations Connected with cx , 1929 .
[9] John Riordan,et al. Introduction to Combinatorial Analysis , 1958 .