Binary trees with the largest number of subtrees ?
This paper characterizes binary trees with n leaves, which have the greatest number of subtrees. These binary trees coincide with those which were shown by Fischermann et al. [Wiener index versus maximum degree in trees, Discrete Appl. Math. 122(13) (2002) 127137] and Jelen and Triesch [Superdominance order and distance of trees with bounded maximum degree, Discrete Appl. Math. 125 (23) (2003) 225233] to minimize the Wiener index.
binary tree subtree wiener index