2020/07/15 by Aida Abiad, Bart De Bruyn, Abiad, Aida +5 · 1 citation
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2007.07520
openalex publication_date 2020/07/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this paper we give some sufficient and necessary conditions for a Neumaier graph to be strongly regular. Further we show that there does not exist Neumaier graphs with exactly four distinct eigenvalues. We also determine the Neumaier graphs with smallest eigenvalue -2.