EXTREMAL ALBERTSON IRREGULARITY: THE QUASI-PERFECT GRAPH CONJECTURE, FIBONACCI MULTIPLICITY AND STRUCTURAL STABILITY

Let G be a connected graph whose degree set is {1, . . . , ∆}. We prove the conjectureof Dorjsembe, Buyantogtokh, Gutman, Horoldagva and Réti: the unique graph of order nmaximizing Albertson irregularity in this class is the quasi-perfect graph QPn. The theoremholds without a maximum-degree restriction. We determine the second distinct maximumfor every n ≥ 4 and the third for n ≥ 25, with the remaining orders covered by exact finitecertificates. Second-maximizing graphs have Fibonacci multiplicity outside five exceptionalisomorphism classes. We also give a binary-matrix recurrence for third-maximizer multiplicityand prove a linear-deficit stability theorem. Complete integer-arithmetic verification code isincluded.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24397486
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

EXTREMAL ALBERTSON IRREGULARITY: THE QUASI-PERFECT GRAPH CONJECTURE, FIBONACCI MULTIPLICITY AND STRUCTURAL STABILITY

Tony Newton
1 links
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

EXTREMAL ALBERTSON IRREGULARITY: THE QUASI-PERFECT GRAPH CONJECTURE, FIBONACCI MULTIPLICITY AND STRUCTURAL STABILITY

Tony Newton
preprint en

Abstract

Let G be a connected graph whose degree set is {1, . . . , ∆}. We prove the conjectureof Dorjsembe, Buyantogtokh, Gutman, Horoldagva and Réti: the unique graph of order nmaximizing Albertson irregularity in this class is the quasi-perfect graph QPn. The theoremholds without a maximum-degree restriction. We determine the second distinct maximumfor every n ≥ 4 and the third for n ≥ 25, with the remaining orders covered by exact finitecertificates. Second-maximizing graphs have Fibonacci multiplicity outside five exceptionalisomorphism classes. We also give a binary-matrix recurrence for third-maximizer multiplicityand prove a linear-deficit stability theorem. Complete integer-arithmetic verification code isincluded.

Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon