Structural Components Dominate Asymptotic Behavior on Sombor Index with Iterated Pendant Constructions

This paper derives a general recursive formula for the Sombor index of multi-level pendant-augmented path trees with nonuniform degree distributions, addressing the lack of closed-form expressions for such complex hierarchical structures.

The Gist

Here is an explanation of the paper "Structural Components Dominate Asymptotic Behavior on Sombor Index with Iterated Pendant Constructions" using simple language and creative analogies.

The Big Picture: Measuring the "Weight" of a Tree

Imagine you are an architect designing a massive, branching tree. In the world of chemistry and math, this tree represents a molecule (like a complex drug or a polymer). To understand how this molecule behaves, scientists use a special ruler called the Sombor Index.

Think of the Sombor Index as a "Structural Weight Score." It doesn't just count how many branches a tree has; it calculates a "heaviness" based on how crowded the connection points (vertices) are.

• If a branch connects to a tiny, lonely tip, it's light.
• If a branch connects to a massive, crowded hub where many other branches meet, it's heavy.

The formula for this score is simple: for every connection between two points, you take the square root of the sum of their "crowdedness" squared.
$$\text{Score} = \sqrt{(\text{Crowdedness}_A)^2 + (\text{Crowdedness}_B)^2}$$

The Problem: The "Tower of Babel" Gap

For simple trees (like a straight line of branches or a star shape), mathematicians already knew how to calculate this score. They had a "cheat sheet" (a closed-form formula).

However, real-world molecules are often hierarchical. Imagine a tree where:

1. You have a main trunk (the spine).
2. You attach small branches to the trunk.
3. Then, you attach even smaller branches to those small branches.
4. Then, you attach tiny twigs to those.

This is called an iterated pendant construction. It's like a fractal tree or a Russian nesting doll made of branches. Until this paper, nobody had a simple formula to calculate the "Structural Weight Score" for these complex, multi-layered trees. It was like trying to weigh a skyscraper by counting every single brick individually without a blueprint.

The Solution: The "Recursive Blueprint"

The author, Jasem Hamoud, built a recursive blueprint. Instead of trying to weigh the whole tree at once, he figured out how to calculate the weight layer by layer.

The Analogy of the "Spine and the Leaves":
Imagine the tree has a main backbone (the spine).

• Odd-numbered spots on the backbone have a specific type of branch growing out of them.
• Even-numbered spots have a slightly different type of branch (maybe they are slightly heavier or have a different growth pattern).

The author discovered that if you know:

1. How long the backbone is.
2. How many branches grow from each spot.
3. How the "heaviness" changes as you go deeper into the layers.

...you can write a single, neat equation that tells you the total score for the entire tree, no matter how many layers deep it goes.

The Big Discovery: How the Score Grows

The most exciting part of the paper is what happens when you keep adding layers forever (asymptotic behavior). The author asked: "If I keep adding layers to this tree, how fast does the Structural Weight Score explode?"

He compared this to two other famous ways of measuring trees:

1. The Wiener Index (Distance): This measures how far apart all the leaves are. If you add layers, the tree gets wider and taller. The distance between leaves grows cubically (like a cube: $t^3$). It's like the tree is expanding into a 3D space very fast.
2. The Sombor Index (Degree/Crowdedness): This measures how crowded the connections are.

The Surprise:
The author found that the Sombor Index grows quadratically (like a square: $t^2$).

• Why? Because the "crowdedness" of the nodes only increases linearly (step-by-step). When you square that linear growth and add it up, you get a square ($t^2$).
• The Metaphor: Imagine a party.
  • The Wiener Index is like measuring how long it takes for everyone to walk from one side of the room to the other. As the room gets bigger, the walking time gets really long very fast.
  • The Sombor Index is like measuring how loud the room is based on how many people are hugging each other. As more people join, the "hugging noise" gets louder, but it follows a predictable, slightly slower curve than the walking time.

Why This Matters

1. Chemistry: Chemists use these indices to predict how a molecule will react or how stable it is. Having a formula for complex, multi-layered molecules means they can design better drugs or materials without needing a supercomputer to simulate every single atom.
2. Math: It fills a huge gap in the "dictionary" of graph theory. Before this, we could only describe simple trees. Now, we have a language to describe complex, fractal-like structures.

Summary in One Sentence

This paper provides a master key (a recursive formula) to instantly calculate the "structural weight" of incredibly complex, multi-layered trees, revealing that while these trees get huge, their internal "crowdedness" score grows in a predictable, quadratic pattern rather than exploding uncontrollably.

Technical Summary

Here is a detailed technical summary of the paper "Structural Components Dominate Asymptotic Behavior on Sombor Index with Iterated Pendant Constructions" by Jasem Hamoud.

1. Problem Statement

The paper addresses a significant gap in the study of the Sombor index ($SO(G)$), a degree-based topological descriptor defined as $\sum_{uv \in E(G)} \sqrt{d(u)^2 + d(v)^2}$. While closed-form expressions exist for simple graph families (paths, stars, cycles, and basic caterpillars), there is a lack of analytical frameworks for:

• Complex Hierarchical Trees: Specifically, trees with multi-level pendant structures where degrees propagate recursively.
• Non-uniform Degree Distributions: Structures where pendant vertices themselves receive further attachments, creating dynamic degree changes across levels.
• Asymptotic Behavior: Understanding how the index scales with the depth of iteration ($t$) and which structural components (local degrees vs. global distances) dominate the growth.

Existing literature largely treats vertex degrees as static local parameters, failing to account for the cumulative impact of multi-level degree interactions in iteratively constructed graphs.

2. Methodology

The author employs a combination of combinatorial graph theory, inductive proofs, and asymptotic analysis to derive exact formulas and growth rates.

• Graph Construction: The study focuses on multi-level pendant-augmented path trees. These are constructed from a "spine" path $P_n$ where vertices are iteratively augmented over $m$ hierarchical levels.
  • Odd-indexed spine vertices: Branch with a replication factor $k$ and specific terminal degrees.
  • Even-indexed spine vertices: Incorporate an initial offset $\ell_1 > 2$, creating heterogeneous degree distributions that propagate through subsequent levels.
• Recursive Decomposition: The edge set is partitioned by levels. The Sombor index is calculated by summing contributions from:
  1. Spine edges.
  2. Edges connecting level $i$ to level $i+1$.
  3. Edges connecting the final level to leaves.
• Parity-Sensitive Counting: The formulas utilize floor ($\lfloor \cdot \rfloor$) and ceiling ($\lceil \cdot \rceil$) functions to accurately enumerate edges based on the parity of the spine length $n$ and the alternating nature of the degree sequences.
• Asymptotic Modeling: The paper analyzes the sequence of graphs $\{G_t\}$ generated by attaching $k$ new pendant vertices to every vertex of $G_{t-1}$. It compares the growth of degree-based indices ($SO, M_1, M_2$) against the distance-based Wiener index ($W$).

3. Key Contributions

The paper makes several theoretical advancements:

• General Recursive Formula (Theorem 3.1): Derives a closed-form expression for the Sombor index of iterated pendant-augmented paths ($CT(n, p, k, \ell_1, \dots, \ell_m)$). The formula separates contributions from the spine and each hierarchical level, accounting for the distinct degrees of descendants from odd vs. even spine vertices.
  $$SO(T) = \lambda_1 + \lambda_2 + \lambda_3 + \sum_{i=1}^{m} (SO^{(i)}_{odd} + SO^{(i)}_{even})$$
• Exact Formulas for Heterogeneous Structures: Provides specific closed-form solutions for:
  • Paths with alternating vertex degrees (Proposition 2.2).
  • Augmented paths with heterogeneous pendant degrees (Lemma 2.3).
  • Unicyclic graphs with uniform pendant attachments (Theorem 3.2).
• Asymptotic Growth Characterization:
  • Establishes that under uniform iterated pendant extension, the Sombor index grows quadratically with respect to the iteration depth $t$ ($SO(G_t) = \Theta(t^2)$).
  • Demonstrates that the Wiener index grows cubically ($W(G_t) = \Theta(t^3)$) due to its dependence on pairwise distances, whereas degree-based indices depend only on local degree escalation.
• Correction of Polynomial Fits: The paper challenges the assumption that low-degree polynomial fits (e.g., $at^2$) are sufficient for extrapolation. It shows that due to the exponential growth of the number of vertices ($n_t \approx 4^t$ in the examples), the underlying growth is better described by models involving exponential factors (e.g., $a \cdot 4^t \cdot t^2$), rendering simple polynomial regression inaccurate for large $t$.

4. Key Results

• Theorem 4.3: Proves that for a sequence of graphs $G_t$ constructed by attaching $k$ pendants to every vertex, the Sombor index behaves asymptotically as:
  $$SO(G_t) = \sqrt{2} m_0 k^2 t^2 + k n_0 t^2 + O(t)$$
  where $m_0$ and $n_0$ are the initial edges and vertices. The dominant term is quadratic in $t$.
• Bounds (Theorem 3.3 & Corollary 3.4): Establishes upper and lower bounds for the Sombor index of unicyclic graphs based on the number of vertices $n$ and maximum degree $\Delta$.
  • Lower bound: $2\sqrt{2}n$(attained by cycles$C_n$).
  • Upper bound: $\sqrt{2} \sum d_i^2$ (attained by star-like dominant graphs).
• Structural Dominance: The analysis confirms that degree amplification (the increase in local vertex degrees) is the primary driver of the Sombor index's growth, rather than edge accumulation alone.

5. Significance

• Theoretical Unification: The work moves the study of the Sombor index from isolated calculations on simple graphs to a unified theoretical framework for complex, recursively constructed graphs.
• Chemical Graph Theory Applications: The derived formulas allow for the exact computation of topological descriptors for polymer structures and molecular trees with multi-level branching, which are common in chemical modeling but previously lacked analytical tools.
• Methodological Insight: By distinguishing between the quadratic growth of degree-based indices and the cubic growth of distance-based indices, the paper clarifies how different structural features (local connectivity vs. global topology) influence topological descriptors.
• Extremal Theory Foundation: The closed-form expressions provide the necessary foundation for future research into extremal problems (finding graphs that maximize/minimize the index) within the class of hierarchical trees, a problem previously intractable due to the lack of general formulas.

In summary, this paper provides the first rigorous, closed-form analytical framework for calculating the Sombor index on complex, multi-level hierarchical trees, revealing that structural dominance in these graphs is driven by the recursive propagation of vertex degrees.