Bounds on the Albertson Index for Trees with Given Degree Sequences Article Swipe

PDF

YOU? · · 2025 · Open Access · · DOI: https://doi.org/10.48550/arxiv.2512.06023

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.

Related Topics

Global Peace Index

Bloomberg Billionaires Index

Global Financial Centres Index

Democracy-Dictatorship Index

Concepts

No concepts available.

Metadata

Type: preprint
Language: en
Landing Page: http://arxiv.org/abs/2512.06023
PDF: https://arxiv.org/pdf/2512.06023
OA Status: green
OpenAlex ID: https://openalex.org/W4417008071

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W4417008071

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.48550/arxiv.2512.06023

Digital Object Identifier
Title: Bounds on the Albertson Index for Trees with Given Degree Sequences

Work title
Type: preprint

OpenAlex work type
Language: en

Primary language
Publication year: 2025

Year of publication
Publication date: 2025-12-04

Full publication date if available
Authors: Jasem Hamoud, Duaa Abdullah

List of authors in order
Landing page: https://arxiv.org/abs/2512.06023

Publisher landing page
PDF URL: https://arxiv.org/pdf/2512.06023

Direct link to full text PDF
Open access: Yes

Whether a free full text is available
OA status: green

Open access status per OpenAlex
OA URL: https://arxiv.org/pdf/2512.06023

Direct OA link when available
Cited by: 0

Total citation count in OpenAlex

Full payload

id	https://openalex.org/W4417008071
doi	https://doi.org/10.48550/arxiv.2512.06023
ids.doi	https://doi.org/10.48550/arxiv.2512.06023
ids.openalex	https://openalex.org/W4417008071
fwci
type	preprint
title	Bounds on the Albertson Index for Trees with Given Degree Sequences
biblio.issue
biblio.volume
biblio.last_page
biblio.first_page
is_xpac	False
apc_list
apc_paid
language	en
locations[0].id	pmh:oai:arXiv.org:2512.06023
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S4306400194
locations[0].source.issn
locations[0].source.type	repository
locations[0].source.is_oa	True
locations[0].source.issn_l
locations[0].source.is_core	False
locations[0].source.is_in_doaj	False
locations[0].source.display_name	arXiv (Cornell University)
locations[0].source.host_organization	https://openalex.org/I205783295
locations[0].source.host_organization_name	Cornell University
locations[0].source.host_organization_lineage	https://openalex.org/I205783295
locations[0].license
locations[0].pdf_url	https://arxiv.org/pdf/2512.06023
locations[0].version	submittedVersion
locations[0].raw_type	text
locations[0].license_id
locations[0].is_accepted	False
locations[0].is_published	False
locations[0].raw_source_name
locations[0].landing_page_url	http://arxiv.org/abs/2512.06023
locations[1].id	pmh:oai:HAL:hal-05395348v1
locations[1].is_oa	True
locations[1].source.id	https://openalex.org/S4306402512
locations[1].source.issn
locations[1].source.type	repository
locations[1].source.is_oa	False
locations[1].source.issn_l
locations[1].source.is_core	False
locations[1].source.is_in_doaj	False
locations[1].source.display_name	HAL (Le Centre pour la Communication Scientifique Directe)
locations[1].source.host_organization	https://openalex.org/I1294671590
locations[1].source.host_organization_name	Centre National de la Recherche Scientifique
locations[1].source.host_organization_lineage	https://openalex.org/I1294671590
locations[1].license	cc-by
locations[1].pdf_url	https://hal.science/hal-05395348/document
locations[1].version	submittedVersion
locations[1].raw_type	Preprints, Working Papers, ...
locations[1].license_id	https://openalex.org/licenses/cc-by
locations[1].is_accepted	False
locations[1].is_published	False
locations[1].raw_source_name	2025
locations[1].landing_page_url	https://hal.science/hal-05395348
locations[2].id	doi:10.48550/arxiv.2512.06023
locations[2].is_oa	True
locations[2].source.id	https://openalex.org/S4306400194
locations[2].source.issn
locations[2].source.type	repository
locations[2].source.is_oa	True
locations[2].source.issn_l
locations[2].source.is_core	False
locations[2].source.is_in_doaj	False
locations[2].source.display_name	arXiv (Cornell University)
locations[2].source.host_organization	https://openalex.org/I205783295
locations[2].source.host_organization_name	Cornell University
locations[2].source.host_organization_lineage	https://openalex.org/I205783295
locations[2].license	cc-by
locations[2].pdf_url
locations[2].version
locations[2].raw_type	article
locations[2].license_id	https://openalex.org/licenses/cc-by
locations[2].is_accepted	False
locations[2].is_published
locations[2].raw_source_name
locations[2].landing_page_url	https://doi.org/10.48550/arxiv.2512.06023
indexed_in	arxiv, datacite
authorships[0].author.id	https://openalex.org/A5097398935
authorships[0].author.orcid	https://orcid.org/0009-0002-0192-3627
authorships[0].author.display_name	Jasem Hamoud
authorships[0].countries	RU
authorships[0].affiliations[0].institution_ids	https://openalex.org/I153845743
authorships[0].affiliations[0].raw_affiliation_string	MIPT - Moscow Institute of Physics and Technology [Moscow] (9 Institutskiy per., Dolgoprudny, Moscow Region, 141701 - Russia)
authorships[0].institutions[0].id	https://openalex.org/I153845743
authorships[0].institutions[0].ror	https://ror.org/00v0z9322
authorships[0].institutions[0].type	education
authorships[0].institutions[0].lineage	https://openalex.org/I153845743
authorships[0].institutions[0].country_code	RU
authorships[0].institutions[0].display_name	Moscow Institute of Physics and Technology
authorships[0].author_position	first
authorships[0].raw_author_name	Jasem Hamoud
authorships[0].is_corresponding	False
authorships[0].raw_affiliation_strings	MIPT - Moscow Institute of Physics and Technology [Moscow] (9 Institutskiy per., Dolgoprudny, Moscow Region, 141701 - Russia)
authorships[1].author.id	https://openalex.org/A5110257990
authorships[1].author.orcid	https://orcid.org/0009-0008-6855-1729
authorships[1].author.display_name	Duaa Abdullah
authorships[1].countries	RU
authorships[1].affiliations[0].institution_ids	https://openalex.org/I153845743
authorships[1].affiliations[0].raw_affiliation_string	MIPT - Moscow Institute of Physics and Technology [Moscow] (9 Institutskiy per., Dolgoprudny, Moscow Region, 141701 - Russia)
authorships[1].institutions[0].id	https://openalex.org/I153845743
authorships[1].institutions[0].ror	https://ror.org/00v0z9322
authorships[1].institutions[0].type	education
authorships[1].institutions[0].lineage	https://openalex.org/I153845743
authorships[1].institutions[0].country_code	RU
authorships[1].institutions[0].display_name	Moscow Institute of Physics and Technology
authorships[1].author_position	last
authorships[1].raw_author_name	Duaa Abdullah
authorships[1].is_corresponding	False
authorships[1].raw_affiliation_strings	MIPT - Moscow Institute of Physics and Technology [Moscow] (9 Institutskiy per., Dolgoprudny, Moscow Region, 141701 - Russia)
has_content.pdf	False
has_content.grobid_xml	False
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://arxiv.org/pdf/2512.06023
open_access.oa_status	green
open_access.any_repository_has_fulltext	False
created_date	2025-12-04T00:00:00
display_name	Bounds on the Albertson Index for Trees with Given Degree Sequences
has_fulltext	False
is_retracted	False
updated_date	2025-12-11T00:21:10.989143
primary_topic
cited_by_count	0
locations_count	3
best_oa_location.id	pmh:oai:arXiv.org:2512.06023
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S4306400194
best_oa_location.source.issn
best_oa_location.source.type	repository
best_oa_location.source.is_oa	True
best_oa_location.source.issn_l
best_oa_location.source.is_core	False
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	arXiv (Cornell University)
best_oa_location.source.host_organization	https://openalex.org/I205783295
best_oa_location.source.host_organization_name	Cornell University
best_oa_location.source.host_organization_lineage	https://openalex.org/I205783295
best_oa_location.license
best_oa_location.pdf_url	https://arxiv.org/pdf/2512.06023
best_oa_location.version	submittedVersion
best_oa_location.raw_type	text
best_oa_location.license_id
best_oa_location.is_accepted	False
best_oa_location.is_published	False
best_oa_location.raw_source_name
best_oa_location.landing_page_url	http://arxiv.org/abs/2512.06023
primary_location.id	pmh:oai:arXiv.org:2512.06023
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S4306400194
primary_location.source.issn
primary_location.source.type	repository
primary_location.source.is_oa	True
primary_location.source.issn_l
primary_location.source.is_core	False
primary_location.source.is_in_doaj	False
primary_location.source.display_name	arXiv (Cornell University)
primary_location.source.host_organization	https://openalex.org/I205783295
primary_location.source.host_organization_name	Cornell University
primary_location.source.host_organization_lineage	https://openalex.org/I205783295
primary_location.license
primary_location.pdf_url	https://arxiv.org/pdf/2512.06023
primary_location.version	submittedVersion
primary_location.raw_type	text
primary_location.license_id
primary_location.is_accepted	False
primary_location.is_published	False
primary_location.raw_source_name
primary_location.landing_page_url	http://arxiv.org/abs/2512.06023
publication_date	2025-12-04
publication_year	2025
referenced_works_count	0
abstract_inverted_index.+	38, 44
abstract_inverted_index.-	35, 41, 48, 52, 56
abstract_inverted_index.=	46
abstract_inverted_index.1}	36, 42, 49, 53
abstract_inverted_index.2}	57
abstract_inverted_index.In	0
abstract_inverted_index.We	61
abstract_inverted_index.\[	32
abstract_inverted_index.\]	60
abstract_inverted_index.in	90, 144
abstract_inverted_index.of	13, 28, 73, 88, 116, 130, 140
abstract_inverted_index.on	9, 80
abstract_inverted_index.we	3
abstract_inverted_index.Our	100
abstract_inverted_index.and	6, 21, 70, 85, 118, 133
abstract_inverted_index.but	108
abstract_inverted_index.for	127, 137
abstract_inverted_index.new	125
abstract_inverted_index.not	102
abstract_inverted_index.the	10, 25, 68, 74, 86, 114, 128, 138
abstract_inverted_index.also	109
abstract_inverted_index.deep	16
abstract_inverted_index.edge	83
abstract_inverted_index.only	103
abstract_inverted_index.open	124
abstract_inverted_index.that	65
abstract_inverted_index.this	1
abstract_inverted_index.tree	30
abstract_inverted_index.{d_1	40
abstract_inverted_index.2}^{n	47
abstract_inverted_index.These	122
abstract_inverted_index.d_1$.	99
abstract_inverted_index.graph	22, 131, 146
abstract_inverted_index.index	12, 27
abstract_inverted_index.novel	5
abstract_inverted_index.sharp	7
abstract_inverted_index.study	139
abstract_inverted_index.their	119
abstract_inverted_index.tools	136
abstract_inverted_index.trees	117
abstract_inverted_index.where	24, 94
abstract_inverted_index.\left(	39
abstract_inverted_index.bounds	8, 107
abstract_inverted_index.degree	19, 91
abstract_inverted_index.derive	62
abstract_inverted_index.index,	76
abstract_inverted_index.paper,	2
abstract_inverted_index.trees,	14
abstract_inverted_index.values	72
abstract_inverted_index.vertex	81
abstract_inverted_index.{{d_i}	51, 55
abstract_inverted_index.{{d_n}	34
abstract_inverted_index.avenues	126
abstract_inverted_index.average	87
abstract_inverted_index.between	18, 113
abstract_inverted_index.counts,	84
abstract_inverted_index.improve	104
abstract_inverted_index.indices	143
abstract_inverted_index.maximum	71
abstract_inverted_index.minimum	69
abstract_inverted_index.results	101
abstract_inverted_index.satisfy	31
abstract_inverted_index.theory.	147
abstract_inverted_index.uncover	110
abstract_inverted_index.{\left(	50
abstract_inverted_index.\right)}	58
abstract_inverted_index.advances	123
abstract_inverted_index.analysis	129
abstract_inverted_index.degrees,	82
abstract_inverted_index.elements	89
abstract_inverted_index.existing	105
abstract_inverted_index.extremal	106
abstract_inverted_index.powerful	63
abstract_inverted_index.presents	4
abstract_inverted_index.sequence	92
abstract_inverted_index.striking	111
abstract_inverted_index.Albertson	11, 26, 75
abstract_inverted_index.\right)^2	37, 43
abstract_inverted_index.essential	135
abstract_inverted_index.intricate	78
abstract_inverted_index.precisely	66
abstract_inverted_index.revealing	15
abstract_inverted_index.sequences	20
abstract_inverted_index.structure	115
abstract_inverted_index.contribute	134
abstract_inverted_index.Caterpillar	29
abstract_inverted_index.connections	17
abstract_inverted_index.topological	142
abstract_inverted_index.characterize	67
abstract_inverted_index.d_2\geqslant	98
abstract_inverted_index.degree-based	141
abstract_inverted_index.dependencies	79
abstract_inverted_index.inequalities	64
abstract_inverted_index.irregularity	23, 120, 132
abstract_inverted_index.$d_n\geqslant	95
abstract_inverted_index.\right)\left(	54
abstract_inverted_index.combinatorial	145
abstract_inverted_index.incorporating	77
abstract_inverted_index.measurements.	121
abstract_inverted_index.relationships	112
abstract_inverted_index.\dots\geqslant	97
abstract_inverted_index.\sum\limits_{i	45
abstract_inverted_index.d_{n-1}\geqslant	96
abstract_inverted_index.\operatorname{irr}(G)=\left(	33
abstract_inverted_index.+\sum_{i=1}^{n-1}\|d_i-d_{i+1}\|.	59
abstract_inverted_index.$\mathscr{D}=(d_1,d_2,\dots,d_n)$	93
cited_by_percentile_year
countries_distinct_count	1
institutions_distinct_count	2
citation_normalized_percentile