Z. Chen, The number of subtrees of trees with given diameter, Discrete Math. Algorithms Appl., 10 (2018), no. 1, 1850001, 16 pp.
R. Kirk and H. Wang, Largest number of subtrees of trees with a given maximum degree, SIAM J. Discrete Math., 22 (2008), no. 3, 985–995.
S. Li and S. Wang, Further analysis on the total number of subtrees of trees, Electron. J. Combin., 19 (2012), no. 4, P48, 14 pp.
A. V. Sills and H. Wang, The minimal number of subtrees of a tree, Graphs Combin., 31 (2015), no. 1, 255–264.
L. A. Székely and H. Wang, On subtrees of trees, Adv. in Appl. Math., 34 (2005), no. 1, 138–155.
L. A. Székely and H. Wang, Binary trees with the largest number of subtrees, Discrete Appl. Math., 155 (2007), no. 3, 374–385.
H. S. Wilf, Generatingfunctionology, Second edition, Academic Press (1994).
Y. Xiao, H. Zhao, Z. Liu and Y. Mao, Trees with large numbers of subtrees, Int. J. Comput. Math., 94 (2017), no. 2, 372–385.
W. Yan and Y. N. Yeh, Enumeration of subtrees of trees, Theoret. Comput. Sci., 369 (2006), no. 1-3, 256–268.
G. Yu and L. Feng, On the Wiener index of unicyclic graphs with given girth, Ars Combin., 94 (2010), 361–369.
X. M. Zhang, X. D. Zhang, D. Gray and H. Wang, Trees with the most subtrees - an algorithmic approach, J. Comb., 3 (2012), no. 2, 207–223.
X. M. Zhang, X. D. Zhang, D. Gray and H. Wang, The number of subtrees of trees with given degree sequence, J. Graph Theory, 73 (2013), no. 3, 280–295.
X. M. Zhang and X. D. Zhang, The minimal number of subtrees with a given degree sequences, Graphs Combin., 31 (2015), no. 1, 309–318.
H. X. Zhao, Research on subgraph polynomials and reliability of networks, Ph.D. thesis, School of Computer, Northwestern Polytechnical University, Xi’an, China, 2004.