🔢 mathematics

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

This paper demonstrates that while greedy trees do not necessarily minimize the graph invariant $\sigma$ among all trees, caterpillar trees fail to achieve the global minimum, and there exist intermediate non-caterpillar, non-greedy trees with $\sigma$ -values strictly between these two bounds, thereby revealing structural limitations of common tree classes in extremal problems.

Original authors: Jasem Hamoud, Duaa Abdullah

Published 2026-02-05

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Jasem Hamoud, Duaa Abdullah

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a city planner trying to design a network of roads (a "tree" in math terms) connecting a certain number of towns. In this paper, the authors are obsessed with one specific question: How uneven is the traffic flow between neighboring towns?

They use a mathematical tool called the Sigma Index to measure this "unevenness" or "irregularity." Think of it like a stress test for the road network. If a huge highway connects to a tiny dirt path, that's a big "stress point" (a high Sigma value). If two small dirt paths connect, or two highways connect, the stress is lower. The goal is to find the road layouts that create the least amount of stress.

Here is the breakdown of their findings, translated into everyday language:

1. The Two Famous Road Designs

The paper looks at two very popular, pre-made designs for these road networks:

The "Caterpillar" Design: Imagine a long, straight main road (the spine) with many short side roads (legs) sticking out of it, like a caterpillar's legs. This is a very common, simple design.
The "Greedy" Design: Imagine building the road network step-by-step. You start with the biggest town and connect it to the next biggest available town, then the next, always trying to pair the "heaviest" traffic hubs together first. This is a "greedy" strategy because it grabs the biggest opportunities immediately.

2. The Big Discovery: The "Goldilocks" Trees

The authors set out to see which of these designs creates the smoothest, least stressful network. They expected the "Greedy" design to be the champion because it pairs big with big and small with small, which usually minimizes stress.

Here is what they found:

The Caterpillar is NOT the best: They proved that the "Caterpillar" design (the long spine with legs) is actually not the most efficient way to minimize stress. It leaves too much "unevenness" in the system.
The Greedy Design is a strong contender: The "Greedy" design does a very good job. It never performs worse than the absolute best possible design.
The Surprise "Hidden" Design: This is the most interesting part. The authors found that there are other, stranger road layouts that are neither Caterpillars nor Greedy trees.
- These "hidden" trees have a stress level that is lower than the Caterpillar design.
- But, they are not quite as perfect as the absolute best possible design (the global minimum).
- Think of it like finding a "Goldilocks" zone: The Caterpillar is too "stiff," the Greedy tree is very good, but there are these weird, in-between trees that sit in a sweet spot that is better than the Caterpillar but not quite the absolute winner.

3. The "Problem" They Solved

The paper spends a lot of time doing complex math to calculate the exact "stress score" (Sigma Index) for very specific, multi-layered road networks.

They imagined trees with a main road, then branches, then branches off those branches, and so on.
They created a "recipe" (formulas) to calculate the stress score for any tree built this way, no matter how many layers it has.
They showed that if you change the rules slightly (like making the branches grow in a specific, non-standard way), the stress score jumps up dramatically.

4. The Takeaway

The main point of this paper is to show that common sense designs aren't always the mathematical best.

Just because a tree looks like a neat "Caterpillar" doesn't mean it's the most efficient at minimizing irregularity.
Just because a tree is built using a "Greedy" strategy doesn't mean it hits the absolute bottom limit of stress, though it gets very close.
There is a whole hidden world of "weird" tree shapes that perform better than the standard Caterpillar but aren't quite the perfect Greedy tree.

In short: The authors mapped out the landscape of tree shapes to find the smoothest paths. They found that the obvious, simple shapes (Caterpillars) aren't the winners, and the "smart" building strategy (Greedy) is great, but the true champions might be some of the stranger, less obvious shapes that sit right in the middle. They provided the math formulas to measure exactly how "smooth" any of these shapes are.

Technical Summary: On Extremal Family Trees Beyond Caterpillars and Greedy Constructions

Problem Statement
This paper investigates the extremal properties of the Sigma index ( $\sigma$ ), a quadratic measure of graph irregularity, over the family $\mathcal{T}_n$ of all trees with $n \geq 3$ vertices. The Sigma index is defined as $\sigma(G) = \sum_{uv \in E(G)} (d_G(u) - d_G(v))^2$ . The central challenge addressed is establishing precise bounds for $\sigma$ and understanding which structural classes of trees achieve these bounds. Specifically, the authors compare the global minimum of $\sigma$ over all trees against the minima attained within restricted subclasses, namely caterpillar trees and greedy trees (trees constructed by connecting vertices to minimize degree disparities locally). The study also seeks to determine if trees that are neither caterpillars nor greedy trees can achieve $\sigma$ -values strictly between the global minimum and the minimum found in caterpillar trees.

Methodology
The authors employ a combination of structural graph theory and combinatorial optimization:

Definitions and Preliminaries: The paper establishes definitions for caterpillar trees (trees where removing leaves yields a path) and greedy trees (constructed by iteratively connecting a new vertex to the existing vertex with the smallest current degree that has not yet reached its target degree).
Transformation Arguments: To prove extremal properties, the authors utilize edge-switching operations. They demonstrate that for any non-greedy tree, a specific edge swap (reconnecting vertices to respect degree ordering) strictly decreases the Sigma index, thereby proving that the greedy tree minimizes $\sigma$ for a fixed degree sequence.
Case Analysis and Induction: The paper analyzes specific tree structures defined by "Problem 1" and "Problem 2." These problems define trees with a central spine and multiple levels of pendant vertices with specific degree constraints (e.g., first-level pendants having degree $1+r$ , second-level having $1+s$ , etc.).
Derivation of Formulas: By partitioning edges based on the levels of the tree (spine-to-level 1, level 1-to-level 2, etc.), the authors derive exact algebraic formulas for $\sigma(T)$ for these structured families. They also analyze the ordering of degree sequences to determine maximum and minimum $\sigma$ values for caterpillar trees.

Key Contributions and Results

Extremal Properties of Greedy Trees: The paper proves that for any graphic degree sequence $D$ , the greedy tree $T_D$ minimizes the Sigma index among all trees realizing $D$ .
Limitations of Caterpillar Trees: The authors prove that caterpillar trees do not achieve the global minimum of $\sigma$ over the entire family $\mathcal{T}_n$ .
Existence of Intermediate Extremal Trees: A significant finding is the proof that there exist trees which are neither caterpillars nor greedy trees that possess $\sigma$ -values strictly between the global minimum and the minimum value attained by caterpillar trees. This establishes a non-empty open interval separating the global minimum from the caterpillar minimum.
Exact Formulas for Structured Trees:
- Lemma 3.2 & 3.3: The paper derives explicit formulas for the Sigma index of trees with three levels of pendants under varying degree conditions (linear vs. squared degree growth).
- Theorem 3.6: A general formula is provided for trees with $n$ spine vertices and $k$ levels of pendants, accounting for the product of branching factors and squared degree differences between levels.
- Proposition 3.3: An exact formula for the Sigma index of a caterpillar tree $C(n, m)$ is provided, distinguishing cases where $n=2$ and $n>2$ .
Bounds: The paper presents upper bounds for the Sigma index of caterpillar trees involving the average degree and sums of squared degree differences (Theorem 3.7).

Significance
The paper claims to offer new insights into the role of non-caterpillar, non-greedy trees in minimizing graph invariants. By demonstrating that the global minimum of the Sigma index is not confined to the well-studied classes of caterpillar or greedy trees, the work highlights structural limitations in using these common classes for extremal problems. The derived exact formulas and bounds provide a unified analytical framework for comparing linear and quadratic irregularity measures in trees. The authors position these results as a foundational cornerstone for the study of topological indices, specifically for structured families of trees, offering precise formulas validated on fixed-size examples and general sequences.

1. The Two Famous Road Designs

2. The Big Discovery: The "Goldilocks" Trees

3. The "Problem" They Solved

4. The Takeaway

More like this