Work

SHARP DEGREE-POWER IRREGULARITY AT DIAMETER n − 6

Year: 2026
Type: preprint
Abstract: For a connected simple graph G, consider the degree-power irregularity Iℓ(G) =Puv∈E(G) |d(u)ℓ − d(v)ℓ|, with ℓ > 0. We determine its exact maximum among all graphsof order n ≥ 10 and diameter n − 6, and characterize every equality graph. The maximumis the largest of three explicit expressions, realized by near-split graphs with two, three, orfour high-degree core vertices. The maximizing structure changes at ℓ = 1 and at a second,uniquely determined threshold ℓc ≈ 4.4070723. Thus the exponent changes the extremalgraph itself, not only the numerical value of the index. The all-order upper bound followsfrom a reduction to finitely many degree-cut signatures and a reproducible exact-arithmeticcertificate.
Author: Newton, Tony
Language: English
Open Access status: green
OpenAlex ID: W7237350822
Cites:
Cited by:
Related to: