Indexed metadata

The integrability of sesqui-regular graphs with smallest eigenvalue at least 3-3

Qianqian Yang, Ruo-Lan Ding

Source record

Source: arXiv

Published: Sep 23, 2026

arXiv: 2609.27700

Open original source ↗

Source abstract

In this paper, we prove that every connected sesqui-regular graph with parameters (n,k,c)(n,k,c), where c3c\geq3, and with smallest eigenvalue in [3,2)[-3,-2) is 11-integrable if its valency is sufficiently large. The bound on cc is optimal: for every integer t2t\geq2, the Cartesian product of the Shrikhande graph and KtK_t is a connected sesqui-regular graph with parameters (16t,t+5,2)(16t,t+5,2) and smallest eigenvalue 3-3, but it is not 11-integrable.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.