Binary trees with the largest number of subtrees with at least one leaf

摘要

This paper characterizes binary trees with n leaves, which have the greatest number of subtrees with at least one leaf. These binary trees coincide with those which were shown by Fischerrnann et al. and Jelen and Triesch to minimize the Wiener index.