Greedy Trees, Caterpillars, and Wiener-Type Graph Invariants

<p> The extremal questions of maximizing or minimizing various distance-based graph invariants among trees with a given degree sequence have been vigorously studied. In many cases, the so-called greedy tree and the caterpillar are found to be extremal. In this note, we show a &ldquo;universal property&rdquo; of the greedy tree with a given degree sequence, namely that the number of pairs of vertices whose distance is at most k is maximized by the greedy tree for all k. This rather strong assertion immediately implies, and is equivalent to, the minimality of the greedy trees with respect to graph invariants of the form W _f (T)= &sum; _{{u,v}&sube;V (T)} f(d(u, v)) for any nonnegative, nondecreasing function f. With di&fflig;erent choices of f, one directly solves the minimization problems of distance-based graph invariants including the classical Wiener index, the Hyper-Wiener index and the generalized Wiener index. We also consider the maximization of some of such invariants among trees with a given degree sequence. These problems turned out to be more complicated. Analogous to the known case of the Wiener index, we show that W _f (T) is maximized by a caterpillar for any increasing and convex function f. This result also leads to a partial characterization of the structure of the extremal caterpillars. Through a similar approach, the maximization problem of the terminal Wiener index is also addressed.</p>