Work

Extremal Albertson Irregularity: the Quasi-perfect Graph Conjecture, Fibonacci Multiplicity and Structural Stability

Year: 2026
Type: preprint
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.
Author: Newton, Tony
Language: English
Open Access status: green
OpenAlex ID: W7237184591
Cites:
Cited by:
Related to: 10