1 |
William Y. C. Chen, Larry X. W. Wang and Arthur L. B. Yang. Recurrence relations for strongly q-log-convex polynomial, Canad. Math. Bull., 54 (2) (2011), 217-229.
DOI
|
2 |
Brian Drake, An inversion theorem for labeled trees and some limits of areas under lattice paths, ProQuest LLC, Ann Arbor, MI, 2008. Thesis (Ph.D.)-Brandeis University.
|
3 |
Martin Klazar, Twelve countings with rooted plane trees, European J. Combin., 18 (2) (1997), 195-210.
DOI
ScienceOn
|
4 |
Seunghyun Seo and Heesung Shin, A generalized enumeration of labeled trees and reverse Prufer algorithm, J. Combin. Theory Ser. A, 114 (7) (2007), 1357-1361.
DOI
ScienceOn
|
5 |
Seunghyun Seo and Heesung Shin, On the enumeration of rooted trees with xed size of maximal decreasing trees, Discrete Math., 312 (2) (2012), 419-426.
DOI
ScienceOn
|
6 |
Peter W. Shor, A new proof of Cayley's formula for counting labeled trees, J. Combin. Theory Ser. A, 71 (1) (1995), 154-158.
DOI
ScienceOn
|
7 |
Richard P. Stanley, Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, 1999. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin.
|
8 |
Jiang Zeng, A Ramanujan sequence that renes the Cayley formula for trees, Ramanujan J., 3 (1) (1999), 45-54.
DOI
ScienceOn
|