Largest Number of Subtrees of Trees with a Given Maximum Degree

[1]  A. A. Dobrynin, , R. Entringer and , and I. Gutman, Wiener index of trees: Theory and applications, Acta Appl. Math., 66 (2001), pp. 211–249. AAMADV 0167-8019 CrossrefISIGoogle Scholar

[2]  M. Fischermann, , A. Hoffmann, , D. Rautenbach, , L. A. Székely and , and L. Volkmann, Wiener index versus maximum degree in trees, Discrete Appl. Math., 122 (2002), pp. 127–137. DAMADU 0166-218X CrossrefISIGoogle Scholar

[3]  C. Heuberger and  and H. Prodinger, On $\alpha$-greedy expansions of numbers, Adv. in Appl. Math., 38 (2007), pp. 505–525. 0196-8858 CrossrefISIGoogle Scholar

[4]  F. Jelen and  and E. Triesch, Superdominance order and distance of trees with bounded maximum degree, Discrete Appl. Math., 125 (2003), pp. 225–233. DAMADU 0166-218X CrossrefISIGoogle Scholar

[5]  B. Knudsen, Optimal multiple parsimony alignment with affine gap cost using a phylogenetic tree, in Algorithms in Bioinformatics, Third International Workshop, Lect. Notes in Bioinform. 2812, Springer, Berlin, 2003, pp. 433–446. Google Scholar

[6]  The On-Line Encyclopedia of Integer Sequences, A092781, http://www.research.att. com/$\!_{^{\sim}}\!$njas/sequences. Google Scholar

[7]  L. A. Székely and  and H. Wang, On subtrees of trees, Adv. in Appl. Math., 34 (2005), pp. 138–155. 0196-8858 CrossrefISIGoogle Scholar

[8]  L. A. Székely and  and H. Wang, Binary trees with the largest number of subtrees with at least one leaf, Congr. Numer., 177 (2005), pp. 147–169. 0384-9864 Google Scholar

[9]  L. A. Székely and  and H. Wang, Binary trees with the largest number of subtrees, Discrete Appl. Math., 155 (2007), pp. 374–385. DAMADU 0166-218X CrossrefISIGoogle Scholar

[10]  S. G. Wagner, Correlation of graph-theoretical indices, SIAM J. Discrete Math., 21 (2007), pp. 33–46. 0895-4801 LinkISIGoogle Scholar