Neumaier graphs with few eigenvalues

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.


Introduction
A regular graph is called edge-regular if any two adjacent vertices have the same number of common neighbours. A regular clique in a regular graph is a clique C having the property that every vertex outside C is adjacent to the same positive number of vertices of C. In the early 1980s, Neumaier [13] studied regular cliques in edge-regular graphs, and a certain class of designs whose point graphs are strongly regular and contain regular cliques. He then posed the problem of whether there exists a non-complete, edge-regular, non-strongly regular graph containing a regular clique, [ [13], page 248].
We define a Neumaier graph as a non-complete edge-regular graph containing a regular clique. A Neumaier graph that is not a strongly regular graph is called a strictly Neumaier graph.
Neumaier graphs have received quite a lot of attention recently. Greaves and Koolen [11] provided the first infinite family of Neumaier graphs, using cyclotomic numbers, showing that strictly Neumaier graphs exist. Goryainov and Shalaginov [10] classified the Cayley-Deza graphs with fewer than 60 vertices, and it turned out that there are four strictly Neumaier graphs with 20 vertices among them. Greaves and Koolen [12] found a new infinite family of strictly Neumaier graphs containing some of the examples found by Goryainov and Shalaginov. Evans, Goryainov and Panasenko [8] obtained some new infinite families of strictly Neumaier graphs by switching an affine polar graph over GF(2 n ) where n is a positive integer. They also showed some general results on Neumaier graphs and their feasible parameter tuples, and presented an application of such results to determine the smallest non-strongly regular Neumaier graph, answering some questions posted by Greaves and Koolen in [11].
We continue the study of Neumaier graphs by studying some of their spectral properties. In particular, in this paper we take a closer look at Neumaier graphs with few distinct eigenvalues. In Section 2 we present several combinatorial and spectral conditions under which a Neumaier graph is a strongly regular graph. We also determine the Neumaier graphs with smallest eigenvalue −2. In Section 3 we show some feasibility conditions of Neumaier graphs with four distinct eigenvalues and we use them to prove that there does not exist strictly Neumaier graphs with exactly four distinct eigenvalues.

Strongly regular Neumaier graphs
In this section we study under which conditions Neumaier graphs have exactly three distinct eigenvalues, that is, we provide several new characterizations of strongly regular Neumaier graphs. A result in this direction was already obtained by Neumaier in Corollary 2.4 of [13]. Recall that not all Neumaier graphs are strongly regular graphs, as it was shown with the constructions by Greaves and Koolen [11,12], and Evans, Goryainov and Panasenko [8].

A combinatorial characterization
Let Γ = (V, E) be a non-complete edge-regular graph on v > 0 vertices having valency k ≥ 1. We denote by λ the constant number of triangles through a given edge. If Γ is a complete multipartite graph, then we denote the total number of its multipartite parts by s + 1. If Γ is not a complete multipartite graph, then we show in Lemma 2.2 that v + λ − 2k = 0. In this case, we define s to be the following number: In Propositions 2.3 and 2.4 below, we show the following.
• Every clique C of Γ has order at most s + 1, with equality if and only if C is a regular clique.
• If Γ has a regular clique (of order s + 1), then v = s + 1 (as Γ is not complete) and every vertex outside C is adjacent to precisely e : Note that if Γ is a Neumaier graph, then there are (regular) cliques of order s + 1. The main goal of this subsection is to prove the following characterization of a particular family of strongly regular Neumaier graphs.
Theorem 2.1. If Γ is a Neumaier graph with the property that every clique of order e + 1 is contained in a clique of order s + 1, then Γ is strongly regular.
We note that there exist infinite families of Neumaier graphs that have the property mentioned in Theorem 2.1. These include the Neumaier graphs that are complete multipartite graphs and the collinearity graphs of finite generalized quadrangles or finite polar spaces.
We will denote the neighbourhood of a vertex v of Γ by v ⊥ = Γ(v). If v is a vertex, then Γ i (v) with i ∈ N denotes the set of vertices at distance i from v. If v and w are two vertices of Γ, then we write v ∼ w or v ∼ w depending on whether v and w are adjacent or not. We denote the edge through two adjacent vertices v and w by vw. For any set X of vertices of Γ, we denote by X := V \ X its complement in V .
If Γ is a complete multipartite graph, then the fact that k ≥ 1 implies that the number (s + 1) of multipartite parts is at least 2, and the fact that Γ is regular and non-complete implies that all multipartite parts have the same order m ≥ 2. In this case, we have v = (s + 1)m, k = sm, λ = (s − 1)m and hence v + λ − 2k = 0. The latter property is sufficient to characterize complete multipartite graphs as the following lemma shows.
Proof. If xy is an edge of Γ, then v ≥ |x ⊥ ∪ y ⊥ | = 2k − λ, implying that v + λ − 2k ≥ 0. Suppose now that equality holds. Then for every three distinct vertices x, y and z for which x ∼ y, we have that z is adjacent to at least one of x, y. If u 1 and u 2 are two non-adjacent vertices and u 1 w is an edge, then the fact that u 1 ∼ u 2 implies that w ∼ u 2 . So, the neighbourhoods of two vertices of Γ are equal if and only if these vertices are nonadjacent. The non-adjacency relation on the vertex set is thus an equivalence relation and Γ is a complete multipartite graph.
Neumaier already observed that if an edge-regular graph has a regular clique, say of order c, then any regular clique has order c and any clique with order c is regular [[13], Theorem 1.1]. The following is implicitly shown in [13], but we add its proof for completeness.
Suppose Γ is not a complete multipartite graph. Every clique C of Γ then has order at most s + 1, and equality occurs if and only if C is a regular clique. In this case, every vertex outside C is adjacent to precisely e vertices of C.
Proof. Suppose C is a clique of order σ + 1 ≥ 1. For every x ∈ C, let e x denote the number of vertices in C adjacent to x. Then Counting in two different ways the pairs (y, x) ∈ C × C with y ∼ x gives x∈C e x = (σ + 1)(k − σ).
Counting in two different ways the pairs (y 1 , y 2 , x) ∈ C × C × C with y 1 = y 2 and From (2) and (3), we find From the Cauchy-Schwartz inequality, we know that with equality if and only if all e x 's are equal, i.e., if and only if {C, C} is an equitable partition. We thus find i.e., By Lemma 2.2, we know that v +λ−2k > 0. As k ≥ 1 and Γ is not complete, we also have k 2 + k − vk = −k(v − (k + 1)) < 0. So, the quadratic equation (5) in the variable σ has two real roots s 1 and s 2 with s 1 < 0 and s 2 > 0. A straightforward computation shows that s 2 = s. So, (5) implies that σ ≤ s. By the above we also know that σ = s if and only if all e x 's are equal, i.e., if and only if C is a regular clique. If all e x 's are equal, then they are equal to their average value ( A similar property as in Proposition 2.3 holds in case Γ is a complete multipartite graph. Note that if Γ is a complete multipartite graph having s + 1 ≥ 2 parts of size m ≥ 2, then e = (s+1)(k−s) v−(s+1) = (s+1)(ms−s) (s+1)m−(s+1) = s. Proposition 2.4. Suppose Γ is a complete multipartite graph. Every clique C of Γ then has order at most s + 1, and equality occurs if and only if C is a regular clique. In this case, every vertex outside C is adjacent to precisely e = s vertices of C.
Proof. Recall that Γ has exactly s + 1 multipartite parts. The obvious bound for |C| is therefore s + 1. If |C| = s + 1, then C contains exactly one point of each of the s + 1 multipartite parts. In this case, every point outside C is adjacent to exactly s vertices of C. If 0 < |C| < s + 1, then there is a point outside C that is adjacent to all |C| vertices of C and a point outside C that is adjacent to exactly |C| − 1 vertices of C, proving that C cannot be a regular clique.
Our next aim is to prove Theorem 2.1. So, from now on, we assume that Γ is a Neumaier graph with the property that every clique of order e + 1 is contained in a clique of order s + 1. Our intention is thus to prove that Γ is strongly regular. In the sequel, a clique of order l will shortly be called an l-clique. By Propositions 2.3 and 2.4, we have: Lemma 2.5. Every (s + 1)-clique is a maximum clique. Hence, e < s + 1.
Proof. This immediately follows from Lemma 1.5(i) in [13]. If C 1 and C 2 were two distinct (s+1)-cliques containing H, then every vertex of C 2 \C 1 is adjacent to all |C 1 ∩C 2 | ≥ e+1 vertices of C 1 ∩ C 2 , an obvious contradiction.
Proof. Let C ′ denote an (s + 1)-clique for which |H ∩ C ′ | is maximal. We show that H ⊆ C ′ . If this were not the case, then there exists a vertex x ∈ H \ C ′ . The set x ⊥ ∩ C ′ then contains H ∩ C ′ and so the unique (s + 1)-clique C ′′ containing the (e + 1)-clique {x} ∪ (x ⊥ ∩ C ′ ) would have a larger intersection with H than C ′ .
Proof. Since Γ is not a complete graph, it suffices to prove that any two distinct nonadjacent vertices x and y have distance 2. By Lemma 2.7, there exists an (s + 1)-clique C through x. Then y ∈ C and y is adjacent to e ≥ 1 vertices of C. So, x and y lie at distance 2 from each other. Lemma 2.9. If E 1 and E 2 are two edges for which |E 1 ∩ E 2 | = 1 and E 1 ∪ E 2 is not a clique, then they are contained in the same number of (s + 1)-cliques.
Indeed, this clique necessarily coincides with the unique (s + 1)-clique containing the (e+1)-clique {y 3−i }∪(y ⊥ 3−i ∩C i ). The lemma then follows by counting in two ways the pairs Lemma 2.10. If E 1 and E 2 are two edges for which |E 1 ∩ E 2 | = 1 and E 1 ∪ E 2 is a clique, then they are contained in the same number of (s + 1)-cliques.
Proof. For any two adjacent vertices u and v, let N uv denote the number of s + 1-cliques containing {u, v}. Put E 1 = xy 1 and E 2 = xy 2 . Let η denote the number of vertices adjacent to x, y 1 and y 2 . Then for every i ∈ {1, 2}, the set A i of vertices distinct from y 3−i adjacent to x and y i but not to y 3−i has order λ − η − 1. Every , then both N xy 1 and N xy 2 are equal to the number of (s + 1)-cliques through {x, y 1 , y 2 }. In the sequel, we may therefore assume that For every z 1 ∈ A 1 , we show that the number of (s + 1)-cliques containing {x, y 1 , z 1 } equals the number of (s + 1)-cliques containing {x, The claim that the numbers of (s + 1)-cliques coincide then follows from counting in two ways all pairs (C 1 , C 2 ) satisfying In a completely similar way, one proves that if z 2 ∈ A 2 , then the number of (s + 1)cliques containing {x, y 2 , z 2 } equals the number of (s + 1)-cliques containing {x, y 1 , y 2 }. If z 1 ∈ A 1 and z 2 ∈ A 2 , we thus see that the number of (s + 1)-cliques containing {x, y 1 , z 1 } coincides with the number of (s + 1)-cliques containing {x, y 2 , z 2 }. We call this number Ω.
We count the number of (s + 1)-cliques containing E 1 , but not E 2 . If C is such a clique, then C contains s + 1 − e > 0 vertices of A 1 . As every vertex of A 1 is contained in Ω (s + 1)-cliques together with E 1 , and no such (s + 1)-clique contains E 2 , we see that the number of (s + 1)-cliques containing E 1 but not E 2 is equal to In a similar way one proves that the total number of (s + 1)-cliques containing E 2 but not To find the total number of (s + 1)-cliques through E i , i ∈ {1, 2}, we should still add to this number the total number of (s + 1)-cliques containing {x, y 1 , y 2 }. But this extra contribution is constant for both E 1 and E 2 .
By Lemmas 2.9, 2.10 and the fact that Γ is connected, we have: Corollary 2.11. The number of (s + 1)-cliques through an edge is constant.
As Γ is regular of valency k ≥ 1, this immediately implies the following via a double counting.
Corollary 2.12. The number of (s + 1)-cliques through a vertex is constant.

Characterizations of strongly regular graphs using eigenvalues
In this section we present some new eigenvalue conditions under which a connected and regular graph is strongly regular. We thus relax the conditions of requiring edge-regularity and a regular clique (i.e., a Neumaier graph) from Section 2.1.
First we need to introduce some definitions. Let Γ = (V, E) be a graph on v ≥ 3 vertices that is not a complete multipartite graph, in particular, Γ is not a complete graph nor a graph without edges.
We denote byk = 2·|E| v > 0 the average degree of the vertices of Γ. We putλ := 6N vk , where N is the total number of triangles of Γ. If we define λ xy := |Γ 1 (x) ∩ Γ 1 (y)| for every edge xy of Γ, then as xy∈E λ xy = 3N and |E| = vk 2 , we see thatλ is the average of the λ xy 's with xy ∈ E.
In Lemmas 2.17 and 2.18 below, we show that v >k + 1 and v +λ − 2k > 0. This implies that the quadratic polynomial has two real roots, a negative one and a positive one which we denote bys. We thus havē We also definē If Γ is a strongly regular graph with parameters (v, k, λ, µ), then (k,λ,μ) = (k, λ, µ) and we will see that k, θ M and θ m are the eigenvalues of Γ (see Lemma 2.21 and its ensuing remark). If Γ is a general graph, then we can interpret θ M and θ m by their algebraic definitions, depending onk,s andμ.
Our main result in this section is as follows.
Theorem 2.14. Suppose Γ is a connected regular graph that is not a complete multipartite graph. If θ M ax2 is the second largest eigenvalue and θ min the smallest eigenvalue of Γ, then In what follows we prove Theorem 2.14 as a special case of a more general result on arbitrary (not necessarily regular) graphs. First we recall some known facts about the spectrum of a graph.

Lemma 2.15. (a)
If Γ ′ is a graph having precisely one eigenvalue, then this eigenvalue is 0 and Γ ′ has no edges.
(b) If Γ ′ is a graph having precisely two eigenvalues, then the connected components of Γ ′ are complete graphs of the same order t ≥ 2.
(c) Every connected regular graph having precisely three eigenvalues is strongly regular.
Condition (a) implies that k x + k y − λ xy = v for every edge xy. As k x = k y = k and v +λ − 2k = 0, we thus have that λ xy =λ for every edge xy of Γ. The graph Γ is thus an edge-regular graph. As in Lemma 2.2, we can then deduce that Γ is a complete multipartite graph, contrary to our assumption. So, we have v +λ − 2k > 0.
If Γ is a strongly regular graph with parameters (v, k, λ, µ), then we know that the eigenvalues of Γ distinct from k are the roots of X 2 + (µ − λ)X + (µ − k) ∈ R[X], i.e. they are equal to θ m and θ M .
The following lemma will be useful in our discussion. It is precisely Theorem 3.2.1 of [3] applied to the graph Γ.
Lemma 2.25. The largest eigenvalue of Γ is at leastk with equality if and only if Γ is regular.
If Γ is a strongly regular graph, we thus know thatk ≥λ + 1 and that θ m is the smallest eigenvalue. In fact, we can prove the following. Proof. Let θ * be the largest eigenvalue of Γ, and put Ω ′ := Ω θ * . By Lemmas 2.24 and 2.25, we have θ * ≥k ≥ θ M . By relying on Lemmas 2.16 and 2.21, we compute This number is equal to As the map R → R; x → (x−θ M ) 2 (x−θ m ) attains a local maximum for x = 2θm+θ M 3 < θ M and a local minimum for x = θ M ≤k ≤ θ * , we have that i.e.
If Γ is connected, then Γ is strongly regular by Lemma 2.15. If Γ is not connected, then each connected component of Γ is regular of degree k and as each ω ∈ Ω θ * = Ω k belongs to {θ M , θ m } we then know that Γ has at most two eigenvalues, implying by Lemma 2.15(a)+(b) that Γ is a disjoint union of at least two complete graphs of the same order. In this case, Γ is thus also a strongly regular graph.
The following is now a consequence of Lemmas 2.26 and 2.27.
Corollary 2.28. If Γ is regular with smallest eigenvalue θ min , then θ min ≤ θ m with equality if and only if Γ is strongly regular.
If Γ is a strongly regular graph with valency k, then we know that θ M is the largest eigenvalue in Ω k . In fact, the following can be proved. Proof. By relying on Lemmas 2.16 and 2.21, we compute This number is equal to We thus have By Lemma 2.15(a)+(b) and the fact that Γ is not complete nor a graph without edges, we know that the multiset Ω ′ = Ω k contains at least two distinct elements. Equation (11) then implies that there exists an ω ∈ Ω ′ with ω ≥ θ M , i.e. θ M ax ≥ θ M . Suppose now that θ M ax = θ M . Then ω ≤ θ M for every ω ∈ Ω ′ . In combination with (11), this implies that ω ∈ {θ M , θ m } for every ω ∈ Ω ′ .
If Γ is connected, then Γ is strongly regular by Lemma 2.15. If Γ is not connected, then each connected component of Γ is regular of degree k and as each ω ∈ Ω ′ = Ω k belongs to {θ M , θ m }, we then know that Γ has at most two eigenvalues, implying by Lemma 2.15(a)+(b) that Γ is a disjoint union of at least two complete graphs of the same order. In this case, Γ is thus also a strongly regular graph. Theorem 2.14 is now implied by Corollary 2.28 and Lemma 2.29.

Characterizations using the Hoffman's ratio bound
Delsarte [[7], page 31] showed that if C is a clique in a strongly regular graph Γ with parameters (v, k, λ, µ), then with θ min the smallest eigenvalue of Γ. A coclique C ′ in Γ can be regarded as a clique in the complementary graph Γ of Γ and so we have with θ Cmin the smallest eigenvalue of Γ. We call a (co)clique that meets the Delsarte bound in (12) or (13) a Delsarte-(co)clique. Note that many people call them Hoffman-(co)cliques. The bound for strongly regular graphs, however, was first given by Delsarte.
Hoffman later generalized it to arbitrary regular graphs, and the bound is often called the ratio bound. Specifically, Hoffman showed that for any coclique C ′ in a regular graph with valency k ≥ 1 on v vertices having smallest eigenvalue θ min , with equality if and only if every vertex outside C has the same number of neighbours in C. A similar characterization for the equality case holds for the inequality (12). For proofs and more background information on these bounds, see [  (1) Γ is a strongly regular Neumaier graph; (2) there exists a clique C in Γ such that |C| attains the Hoffman coclique bound in the complementary graph Γ.
Proof. Let v, k and λ be the parameters of Γ as an edge-regular graph, and define s as in the beginning of Section 2.1.
(2) ⇒ (1). In case Γ is a complete multipartite graph, it must be a strongly regular Neumaier graph, see e.g. Section 2.1. So, for this part of the proof, we may assume that Γ is not a complete multipartite graph. Suppose there exists a clique C in Γ such that |C| attains the Hoffman coclique bound inΓ. Then where θ Cmin is the smallest eigenvalue of Γ. Note that −θ Cmin = θ M ax2 + 1, where θ M ax2 is the second largest eigenvalue of Γ, see e.g. Theorem 2.6 of [2]. We also know that every vertex of V \ C is Γ-adjacent to a constant number of vertices of C, or equivalently, Γ-adjacent to a constant number e of vertices of C. As Γ is connected and non-complete, e > 0 and so C is a regular clique. By Proposition 2.3, we then know that |C| = s + 1 and , we have implying that θ M ax2 = s − e. So, the second largest eigenvalue of Γ is s − e, implying by Theorem 2.14(2) and Lemma 2.23 that Γ is strongly regular. As Γ has a regular clique, it is a Neumaier graph.
(1) ⇒ (2). Suppose Γ is a strongly regular Neumaier graph. If Γ is not a complete multipartite graph, then by Lemmas 2.21 and 2.23, the eigenvalues of Γ are k, s − e and − k s . In fact, by direct verification one can see that this remains true for complete multipartite graphs. So, θ M ax2 = s − e. The upper bound in the Hoffman coclique bound is then equal to Every regular clique in Γ has order s + 1, and so there exists a coclique in Γ attaining the Hoffman coclique bound.
Theorem 2.31. The following are equivalent for a Neumaier graph Γ.
(2) The Delsarte clique bound holds for Γ, i.e. |C| ≤ 1 − k θ min for every clique C, with k the valency of Γ and θ min the smallest eigenvalue of Γ.
Proof. Let v, k and λ be the parameters of Γ as an edge-regular graph, and define s and e as in the beginning of Section 2.1. If C is a clique of Γ, then by Propositions 2.3 and 2.4 we know that |C| ≤ s + 1, with equality if and only if C is a regular clique.
(1) ⇒ (2). Suppose Γ is strongly regular. Similarly as in Theorem 2.30, we then know that k, s − e and − k s are the eigenvalues of Γ. So, 1 − k θ min = s + 1. As |C| ≤ s + 1 for every clique C, we indeed see that the Delsarte clique bound holds in Γ.

A characterization using t-walk regularity
Recall that a t-walk-regular graph is a graph Γ for which the number of walks of a given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most t. Such graphs generalize distance-regular graphs and t-arc-transitive graphs. Every t-walk-regular graph is also regular.
Let Γ be a connected regular graph with distinct eigenvalues k = θ 0 , θ 1 , . . . , θ d and adjacency matrix A. Let R i := j:j =i (A−θ j I) j:j =i θ i −θ j with i ∈ {0, 1, . . . , d} be the primitive idempotent of Γ corresponding to the eigenvalue θ i . We have AR i = θ i R i . Let A i be the i-adjacency matrix, i.e. (A i ) xy = 1 if d(x, y) = i and 0 otherwise. By Theorem 3.1 of [4], we know that Γ is t-walk-regular if and only if for every i ∈ {0, 1, . . . , t} and every j ∈ {0, 1, . . . , d}, there exists an α ij ∈ R such that A i • R j = α ij A i , where • denotes the entrywise product. From now on we assume that Γ is 1-walk-regular. For every i ∈ {0, 1, . . . , d}, we define ǫ i := (R i ) xx where x is any vertex of Γ, and put R i := 1 ǫ i R i . It is easy to see that (R i ) xy = θ i /k for adjacent vertices x and y. Neumaier [[13], Corollary 2.4] showed that a vertex-and edge-transitive graph that has a regular clique must be strongly regular. Since vertex-and edge-regularity implies 1-walk-regularity, the next theorem provides an analogous of Neumaier's result, but it requires a weaker assumption.
Theorem 2.32. Let Γ = (V, E) be a 1-walk-regular graph with a regular clique. Then Γ is a strongly regular graph.
Proof. Let k be the valency of Γ. Let C be a regular clique of size s + 1 and suppose every vertex outside C has e neighbours in C. As e ≥ 1, the graph Γ is connected. Consider the partition P = {C, V \ C}, which has quotient matrix B = s k − s e k − e . The eigenvalues k and s − e < k of B are also eigenvalues of the adjacency matrix A of Γ. If [v 1 v 2 ] T is an eigenvector of B corresponding to s − e, then v 1 = v 2 and the column matrix ω of size |V | with ω x = v 1 if x ∈ C and ω x = v 2 otherwise is an eigenvector of A corresponding to the eigenvector s − e. Note that j = [1 1 · · · 1] T is an eigenvector of A corresponding to k. The characteristic vector χ C of C is a linear combination of ω and j. Assume now that θ i ∈ {k, s − e} is another eigenvalue, with idempotent R i , and consider the matrixR i as defined above. Any column ofR i is orthogonal to ω and j and hence also to χ C . Considering a column ofR i corresponding to a vertex of C, we then find that 1 + su = 0, where u = θ i k . The eigenvalue θ i of Γ is thus uniquely determined. It follows that Γ has at most three distinct eigenvalues. As Γ is also connected and regular, it must be a strongly regular graph. Theorem 2.32 has the following immediate corollary.
Corollary 2.33. It is not possible to construct a Neumaier graph as a relation graph of a symmetric association scheme that does not come from a strongly regular graph.
It is worth noting that there are vertex-transitive Neumaier graphs that are not strongly regular graphs, see for instance the construction provided by Greaves and Koolen [11] which uses Cayley graphs. Note that vertex-transitivity implies 0-walk-regular.
It is also important to note that a vertex-transitive Neumaier graph has diameter 2, and it is not known whether this is still true under the weaker condition of walk-regularity. Examples of Neumaier graphs with diameter 3 are known [9].

A characterization using the smallest eigenvalue being −2
In [Theorem 3.12.4, [1]] it is shown that if a connected graph is edge-regular with smallest eigenvalue −2, then it is strongly regular or the line graph of a triangle-free regular graph. Proposition 2.34. Suppose the line graph L(Γ) of a graph Γ is a Neumaier graph. Then L(Γ) is one of the following: (1) an (s + 1) × (s + 1) rook graph for some s ∈ N \ {0}; (2) a Johnson graph J(s + 2, 2) for some s ∈ N \ {0, 1}; (3) the octahedral graph.
In particular, L(Γ) is a strongly regular graph.
Proof. As adding isolated vertices to a graph does not alter its line graph, we may without loss of generality assume that Γ does not contain isolated vertices. As L(Γ) is connected, the graph Γ must therefore be connected as well. We denote by k the valency of L(Γ) and by λ the constant number of triangles through a given edge of L(Γ). We also assume that C is a regular clique of size s + 1 of L(Γ) and that every vertex of L(Γ) not in C is adjacent to exactly e > 0 vertices of C. As C is a maximal clique, it consists either of all the edges in Γ containing a given vertex or of all three edges in a triangle of Γ.
Suppose first that C consists of all the edges in Γ through a vertex v. Every edge of Γ not incident with v is adjacent to at most two edges in C, implying that e ∈ {1, 2}.
Assume e = 1. Then Γ(v) cannot contain edges. If v ′ is a vertex not belonging to {v} ∪ Γ(v), then the condition e = 1 implies that every edge through v ′ is of the form v ′ w with w one of the s + 1 vertices of Γ(v). The degree k of the edges vw and v ′ w in L(Γ) is This implies that Γ ∼ = K s+1,n for some n ∈ N \ {0, 1}. Edge-regularity in L(Γ) implies that n = s + 1 and that L(Γ) is the (s + 1) × (s + 1) rook graph.
and deg(v 3 ) are equal, say to l, and that k = 2l − 2. Since Γ is connected and has edges outside C, we have l ≥ 3. Note that the set of l ≥ 3 edges through v 1 is a clique of L(Γ). As the maximal size of a clique of L(Γ) is equal to |C| = 3, we have l = 3 and k = 4. Every vertex v i ∈ {v 1 , v 2 , v 3 } is therefore incident with a unique edge e i not contained in ∆. We see that e i and hence all vertices b ∈ C are adjacent with precisely e = 2 edges of C. So, e 1 , e 2 and e 3 are the only edges not in C. As the degree of e 1 in L(Γ) equals k = 4, the edges e 1 , e 2 and e 3 are mutually adjacent, implying that Γ is the tetrahedral graph and L(Γ) is the octahedral graph.

Neumaier graphs with four eigenvalues
Regular graphs with precisely four eigenvalues have already been studied in the literature, see e.g. [5]. In this section, we prove that no such graph can be a Neumaier graph. Proof. Suppose to the contrary that Γ is a Neumaier graph with exactly four eigenvalues k, θ 1 , θ and θ 2 , with k the valency of Γ and k > θ 1 > θ > θ 2 . Suppose C is a regular clique of size s + 1 and every vertex outside C is adjacent to precisely e > 0 vertices of C. Above, we have already seen that e = (s+1)(k−s) v−s−1 with v the number of vertices of Γ, i.e. v = (s + 1)(k − s + e) e .
Counting triangles having exactly one of its edges in C, we find with λ denoting the constant number of triangles containing a given edge.
The equitable partition {C, V \ C} has quotient matrix s k − s e k − e , whose eigenvalues are k and s − e. As these are also eigenvalues of Γ, we have s − e ∈ {θ, θ 1 , θ 2 }. In fact, we can prove that s − e = θ. As C cannot be properly contained in another clique, we have e ≤ s. So, s − e ≥ 0 is distinct from the smallest eigenvalue θ 2 of Γ which is negative. As Γ has exactly four eigenvalues, it is not a strongly regular graph, implying by Theorem 2.14 and Lemma 2.23 that θ 1 > s − e. Summarizing we thus have k > θ 1 > θ = s − e ≥ 0 > θ 2 .