Abstract
A segment of a tree is a path whose ends are branching vertices (vertices of degree greater than 2) or leaves, while all other vertices have degree 2. The lengths of all the segments of a tree form its segment sequence. In this note we consider the problem of maximizing the Wiener index among trees with given segment sequence or number of segments, answering two questions proposed in a recent paper on the subject. We show that the maximum is always obtained for a so-called quasi-caterpillar, and we also further characterize its struc-ture.
| Original language | English |
|---|---|
| Pages (from-to) | 91-104 |
| Number of pages | 14 |
| Journal | Match |
| Volume | 75 |
| Issue number | 1 |
| State | Published - 2016 |
Scopus Subject Areas
- General Chemistry
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics