Asset Details
Do you wish to reserve the book?
Largest Number of Subtrees of Trees with a Given Maximum Degree
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Largest Number of Subtrees of Trees with a Given Maximum Degree
Do you wish to request the book?
Largest Number of Subtrees of Trees with a Given Maximum Degree
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Largest Number of Subtrees of Trees with a Given Maximum Degree
2008
Overview
We characterize trees, given a size and maximum vertex degree, which have the greatest number of subtrees. This generalizes the recent result of Szekely and Wang. These trees coincide with those which were shown by Fischermann et al., and independently Jelen and Triesch, to minimize the Wiener index.
Publisher
Society for Industrial and Applied Mathematics
Subject
