Equality in Nikiforov's average-neighbour-degree bounds for A_α
Year: 2026
Type: preprint
Abstract: For a graph without isolated vertices, Nikiforov bounded the spectral radius of $A_\alpha=\alpha D+(1-\alpha)A$ by the minimum and maximum of $\alpha d(v)+(1-\alpha)m(v)$, where $m(v)$ is the average degree of the neighbours of $v$. We study equality for connected, nonregular graphs and $0<\alpha<1$. Such a graph has at most one equality parameter; it is rational, belongs to $(0,1/2]$, and forces $A_\alpha$ to be singular. At $\alpha=1/2$ the graphs are precisely the nonregular semiregular bipartite graphs. We give an integral recognition criterion and a complete classification when exactly two degrees occur. Conversely, every rational number in $(0,1/2]$ occurs. For every $k\ge 2$ an explicit connected $2k$-vertex graph with $k$ distinct degrees attains equality at $\alpha=1/3$; thus no absolute bound on degree variety is possible. An exact isomorphism-class census through ten vertices, independently generated by nauty and checked with rational arithmetic, yields $599$ irregular cases at order ten. We distinguish proofs from finite computer certificates, and delimit the prior-art search rather than asserting publication novelty. The record holds the article (PDF) and a snapshot of its repository with the LaTeX source, the arXiv package, every certificate (programs, logs, SHA-256) and two independent literature audits. Provenance: ChatGPT research agents (OpenAI) wrote proofs, programs and the draft; Anthropic Claude, the lab's guide, checked the proofs line by line, re-derived the finite results independently (nauty, exact arithmetic) and checked every reference; the author takes responsibility. Text and data CC BY 4.0, code MIT.
Author: Kudriashov, Aleksei
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7233606326
