The minimum least eigenvalue of A_α(G) for 0 < α < 1/2

For a simple graph $G$ of order $n$, let $A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G)$, with $0<\alpha<1/2$. We determine the minimum of its least eigenvalue over all graphs of order $n\ge2$: writing $p=\lfloor n/2\rfloor$ and $q=\lceil n/2\rceil$, the minimum is $(\alpha n-\sqrt{\alpha^2n^2+4(1-2\alpha)pq})/2$, attained precisely by $K_{p,q}$ up to isomorphism. This addresses Problem~30 of Nikiforov (2017). For even $n$, the statement is a direct consequence of published adjacency extremality and the complete-bipartite spectrum; for odd $n$, that deduction is not sharp. We give a uniform proof by sign-pattern deletion and strict Perron comparison. A nonnegative ground-state deficit identity yields a quantitative edit-distance stability estimate. We give exact rational certificates for the second distinct minimum at four parameter values through order seven and at smaller parameters through order nine. The latter show that the odd-order runner-up changes with the parameter. Equitable quotients give an algebraic equation for the candidate crossing; we state a revised two-branch conjecture and distinguish exact certificates from numerical scans. We distinguish mathematical proofs, exact computations, and floating-point evidence, and make no claim of established publication priority beyond a bounded literature search. 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 integer arithmetic), found the small-parameter runner-up switch and checked every reference; the author takes responsibility. Text and data CC BY 4.0, code MIT.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24241614
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The minimum least eigenvalue of A_α(G) for 0 < α < 1/2

Aleksei Kudriashov
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

The minimum least eigenvalue of A_α(G) for 0 < α < 1/2

Aleksei Kudriashov
preprint en

Abstract

For a simple graph $G$ of order $n$, let $A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G)$, with $0<\alpha<1/2$. We determine the minimum of its least eigenvalue over all graphs of order $n\ge2$: writing $p=\lfloor n/2\rfloor$ and $q=\lceil n/2\rceil$, the minimum is $(\alpha n-\sqrt{\alpha^2n^2+4(1-2\alpha)pq})/2$, attained precisely by $K_{p,q}$ up to isomorphism. This addresses Problem~30 of Nikiforov (2017). For even $n$, the statement is a direct consequence of published adjacency extremality and the complete-bipartite spectrum; for odd $n$, that deduction is not sharp. We give a uniform proof by sign-pattern deletion and strict Perron comparison. A nonnegative ground-state deficit identity yields a quantitative edit-distance stability estimate. We give exact rational certificates for the second distinct minimum at four parameter values through order seven and at smaller parameters through order nine. The latter show that the odd-order runner-up changes with the parameter. Equitable quotients give an algebraic equation for the candidate crossing; we state a revised two-branch conjecture and distinguish exact certificates from numerical scans. We distinguish mathematical proofs, exact computations, and floating-point evidence, and make no claim of established publication priority beyond a bounded literature search. 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 integer arithmetic), found the small-parameter runner-up switch and checked every reference; the author takes responsibility. Text and data CC BY 4.0, code MIT.

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