SHARP DEGREE-POWER IRREGULARITY AT DIAMETER n − 6
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.
Authors
- Tony Newton (ORCID: https://orcid.org/0009-0009-9189-6431)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24409616
- Primary Topic
- Graph theory and applications
- Type
- preprint