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

TL;DR

This paper derives recursive formulas for the Sombor index of complex hierarchical trees with multi-level pendant structures, revealing how structural components influence asymptotic behavior in iterated graph constructions.

Contribution

It introduces a general recursive method to compute the Sombor index for multi-level pendant-augmented path trees with hierarchical branching.

Findings

Derived recursive formulas for the Sombor index in complex trees.

Showed the dominance of structural components in asymptotic behavior.

Extended understanding of degree-based topological descriptors in hierarchical graphs.

Abstract

The Sombor index, a degree-based topological descriptor introduced by Gutman in 2021, lacks closed-form expressions for complex hierarchical trees with multi-level pendant structures and nonuniform degree distributions, despite extensive results for simpler families such as paths, stars, cycles, and basic caterpillars. For a simple graph $\mathcal{G}$, the Sombor index is defined as \[ \mathrm{SO}(\mathcal{G}) = \sum_{uv \in E(\mathcal{G})} \sqrt{d(v)^2 + d(u)^2}. \] In this work, we derive a general recursive formula for the Sombor index of multi-level pendant-augmented path trees. These trees are constructed from a spine path $\mathcal{P}_n$ ($n \ge 2$) in which each vertex has degree $2+k$ and are iteratively augmented over $m \ge 1$ hierarchical levels. Pendants attached to odd-indexed spine vertices branch with replication factor $k$ and terminal degree $\ell_i$, whereas those stemming from even-indexed vertices incorporate an initial offset $\ell_1>2$ that propagates through subsequent levels. These results significantly advance the theoretical and computational study of degree-based topological descriptors in iteratively constructed graphs.