Abstract
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(1–3) (2002) 127–137] and Jelen and Triesch [Superdominance order and distance of trees with bounded maximum degree, Discrete Appl. Math. 125 (2–3) (2003) 225–233] to minimize the Wiener index.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
