Extremal Bounds on the Sigma and Albertson Indices for Non-Decreasing Degree Sequences

Abstract

We establish sharp extremal bounds on the Albertson and Sigma irregularity indices for trees with prescribed degree sequences, with emphasis on caterpillar trees as key extremal configurations. New lower and upper bounds are derived in terms of maximum degree, average degree, and auxiliary sequence parameters, highlighting the quadratic growth of the Sigma index relative to the linear Albertson index. Closed-form expressions, direct index relations, and empirical validation confirm the bounds' tightness. These findings extend prior work on linear irregularity measures and offer precise tools for analyzing degree-heterogeneous trees in graph theory and chemical graph applications.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…