Neumaier graphs with few eigenvalues (Q2168070)

A Neumaier graph is a non-complete edge-regular graph containing a regular clique; in this paper, the authors characterize Neumaier graphs as having exactly three distinct eigenvalues, that is, strongly regular Neumaier graphs. In Section 2, the authors give multiple characterizations of these graphs, extending some results in [\textit{A. Neumaier}, Lond. Math. Soc. Lect. Note Ser. 49, 244--259 (1981; Zbl 0466.05026)] They give a characterization in terms of cliques, which is combinatorial; one in terms of the eigenvalues of the graph; one using Hoffman's ratio bound; one using \(t\)-walk regularity; and finally, one using the smallest eigenvalue being \(-2\). In Section 3, they show some feasibility conditions of Neumaier graphs with four distinct eigenvalues and use them to prove that there does not exist strictly Neumaier graphs with exactly four distinct eigenvalues.