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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

SHARP DEGREE-POWER IRREGULARITY AT DIAMETER n − 6

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

SHARP DEGREE-POWER IRREGULARITY AT DIAMETER n − 6

Tony Newton
preprint en

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.

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