On Extremal Family Trees $(\mathcal{T}_n)_{n\geqslant 3}$ Beyond Caterpillars and Greedy Constructions

TL;DR

This paper explores extremal properties of a topological index in trees, showing that greedy trees minimize the index more effectively than caterpillars and revealing the significance of non-caterpillar, non-greedy trees.

Contribution

It establishes that caterpillar trees do not minimize the index, while greedy trees do, and identifies the role of other tree structures in extremal index values.

Findings

Caterpillar trees do not achieve the minimum of the index.

Greedy trees attain the global minimum of the index.

Some non-caterpillar, non-greedy trees have intermediate index values.

Abstract

This paper investigates topological indices for the greedy tree $\mathcal{T}_\mathscr{D}$ associated with a graphic degree sequence $\mathscr{D} = (d_1 \geqslant d_2 \geqslant \dots \geqslant d_n)$ of a tree. A fundamental challenge in the study of topological indices lies in establishing precise bounds, as such findings illuminate intrinsic relationships among diverse indices. We investigate the extremal properties of the graph invariant $\sigma$ over the family $\mathcal{T}_n$ of all trees on $n \ge 3$ vertices. Specifically, we compare the minimum values of $\sigma$ attained in restricted subclasses -- including caterpillar trees and greedy trees -- with the global minimum over $\mathcal{T}_n$. We prove that caterpillar trees do not achieve the minimum value of $\sigma$ among all trees, whereas greedy trees attain values no smaller than this global minimum. Moreover, we show that certain trees, which are neither caterpillars nor greedy trees, have $\sigma$-values strictly between the global minimum over $\mathcal{T}_n$ and the minimum among caterpillar trees. These results highlight structural limitations of these common tree classes in extremal problems and offer new insights into the role of non-caterpillar, non-greedy trees in minimizing graph invariants.