Search arXivSearch

arXiv · 2510.19490

Closed-Form Analysis and Extremal Bounds of Albertson and Sigma Indices in Trees with Prescribed Degree Sequences

Abstract

This study explores the irregularity properties of trees with prescribed degree sequences by analyzing two prominent topological indices: the Albertson index and the sigma index. With a particular emphasis on caterpillar trees -frequently used to model molecular chains- we derive a closed-form expression for the Albertson index: \[ \mathrm{irr}(\mathscr{C}(n,m)) = m(m+1)n - 2m + 2, \quad \text{for } n \geq 3. \] Furthermore, we establish extremal bounds for both indices across tree families characterized by fixed degree sequences. The results yield a unified analytical framework for comparing linear and quadratic irregularity measures, and provide new structural insights relevant to applications in chemical graph theory and extremal graph analysis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jasem Hamoud, Alexey Belov Yakovlevich, Muaadh Almahalebi, Duaa Abdullah. 2025-12-13. Closed-Form Analysis and Extremal Bounds of Albertson and Sigma Indices in Trees with Prescribed Degree Sequences. https://arxiv.org/abs/2510.19490

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO