← ALB News · curated headline

Co-edge-regular graphs with two $\lambda$-values and four distinct eigenvalues

arXiv Mathematics · WORLD · Mathematics · 11/18/2026, 12:00:00 AM

arXiv:2611.21664v1 Announce Type: new Abstract: A connected $k$-regular graph $G$ on $n$ vertices is co-edge-regular if any two distinct non-adjacent vertices have the same number of common neighbors. For adjacent vertices $u$ and $v$, let $\lambda(u,v)=|N(u)\cap N(v)|$. Ge and Koolen asked whether the theorem of Neumaier on strongly regular graphs with fixed smallest eigenvalue extends to co-edge-regular graphs with exactly four distinct eigenvalues in which $\lambda(u,v)$ takes exactly two values over the edges $uv$. In this paper, we answer this question. For every integer $t\ge2$ there is $n_t$ such that if $G$ is such a graph with smallest eigenvalue at least $-t$, $n\ge n_t$, and $k<n-2-(t-1)^2/4$, then either $G$ is a clique extension of a strongly regular graph, or $G$ is obtained from a strongly regular graph with a Hoffman coloring by adding all edges inside the color classes. Consequently, $G$ is a clique extension of a strongly regular graph, a $p\times q$ grid with $p\ne q$, or the block graph of a resolvable Steiner $2$-design in which every parallel class is made into a clique.

Continue to arXiv Mathematics →

You are being forwarded in 6s — stay on this page