Abstract
The Wiener index of a tree is the sum of all pairwise distances between vertices. It is one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. We characterize binary trees with n leaves, which have the greatest number of subtrees (or leaf-containing subtrees). These binary trees coincide with those which were shown by Fischermann et al. and Jelen and Triesch to minimize the Wiener index.
Original language | American English |
---|---|
State | Published - Apr 8 2005 |
Event | Spring Central Sectional Meeting of the American Mathematical Society (AMS) - Duration: Mar 13 2015 → … |
Conference
Conference | Spring Central Sectional Meeting of the American Mathematical Society (AMS) |
---|---|
Period | 03/13/15 → … |
Keywords
- Subtrees of binary trees
- Wiener Index
DC Disciplines
- Mathematics