Binary trees with the largest number of subtrees

Discrete Applied Mathematics

Volumn 155, Issue 3, 2007, Pages 374-385

  Szekely L A ^a   Wang, Hua ^a  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

Binary tree; Subtree; Wiener index

Indexed keywords

NUMBER THEORY; NUMERICAL ANALYSIS;

BINARY TREES; SUBTREES; WIENER INDEX;

TREES (MATHEMATICS);

EID: 33751173389     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.05.008     Document Type: Article

References (7)

1. Fischermann M., Hoffmann A., Rautenbach D., Székely L.A., and Volkmann L. Wiener index versus maximum degree in trees. Discrete Appl. Math. 122 1-3 (2002) 127-137
2. C. Heuberger, H. Prodinger, On α-greedy expansions of numbers, 〈http://finanz.math.tu-graz.ac.at/∼prodinger/pdffiles/〉.
3. Jelen F., and Triesch E. Superdominance order and distance of trees with bounded maximum degree. Discrete Appl. Math. 125 2-3 (2003) 225-233
4. B. Knudsen, Optimal Multiple Parsimony Alignment With Affine Gap Cost Using a Phylogenetic Tree, Lecture Notes in Bioinformatics, vol. 2812, Springer, Berlin, 2003, pp. 433-446.
5. The On-Line Encyclopedia of Integer Sequences, A092781. 〈http://www.research.att.com/∼njas/sequences〉.
6. Székely L.A., and Wang H. On subtrees of trees. Adv. Appl. Math. 34 (2005) 138-155
7. L.A. Székely, H. Wang, Binary trees with the largest number of subtrees with at least one leaf, Congr. Numer. 177 (2005) 147-169.