Closed-Form Analysis and Extremal Bounds of Albertson and Sigma Indices in Trees with Prescribed Degree Sequences
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909959098204160 |
|---|---|
| author | Hamoud, Jasem Yakovlevich, Alexey Belov Almahalebi, Muaadh Abdullah, Duaa |
| author_facet | Hamoud, Jasem Yakovlevich, Alexey Belov Almahalebi, Muaadh Abdullah, Duaa |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_19490 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Closed-Form Analysis and Extremal Bounds of Albertson and Sigma Indices in Trees with Prescribed Degree Sequences Hamoud, Jasem Yakovlevich, Alexey Belov Almahalebi, Muaadh Abdullah, Duaa Combinatorics 05C05, 05C12, 05C20, 05C25, 05C35, 05C76, 68R10 G.2.2 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. |
| title | Closed-Form Analysis and Extremal Bounds of Albertson and Sigma Indices in Trees with Prescribed Degree Sequences |
| topic | Combinatorics 05C05, 05C12, 05C20, 05C25, 05C35, 05C76, 68R10 G.2.2 |
| url | https://arxiv.org/abs/2510.19490 |