Bounds on the Albertson Index for Trees with Given Degree Sequences

TL;DR

This paper establishes sharp bounds on the Albertson index for trees based on degree sequences, revealing deep structural relationships and improving existing extremal bounds in graph irregularity analysis.

Contribution

It introduces novel inequalities that precisely determine the minimum and maximum Albertson index values for trees with given degree sequences, enhancing understanding of graph irregularity.

Findings

Derived exact bounds for the Albertson index in trees.

Established relationships between degree sequences and graph irregularity.

Improved upon previous extremal bounds for the Albertson index.

Abstract

In this paper, we presents novel and sharp bounds on the Albertson index of trees, revealing deep connections between degree sequences and graph irregularity where the Albertson index of Caterpillar tree satisfy \[ \operatorname{irr}(G)=\left( {{d_n} - 1} \right)^2 + \left( {d_1 - 1} \right)^2 + \sum\limits_{i = 2}^{n - 1} {\left( {{d_i} - 1} \right)\left( {{d_i} - 2} \right)} +\sum_{i=1}^{n-1}|d_i-d_{i+1}|. \] We derive powerful inequalities that precisely characterize the minimum and maximum values of the Albertson index, incorporating intricate dependencies on vertex degrees, edge counts, and the average of elements in degree sequence $\mathscr{D}=(d_1,d_2,\dots,d_n)$ where $d_n\geqslant d_{n-1}\geqslant \dots\geqslant d_2\geqslant d_1$. Our results not only improve existing extremal bounds but also uncover striking relationships between the structure of trees and their irregularity measurements. These advances open new avenues for the analysis of graph irregularity and contribute essential tools for the study of degree-based topological indices in combinatorial graph theory.