Vertex-transitive Neumaier graphs

Abstract

A graph $\hat{I}“$ is called edge-regular whenever it is regular and for any two adjacent vertices, the number of their common neighbors is independent of the choice of vertices. A clique $C$ in $\hat{I}“$ is called regular whenever for any vertex out of $C$, the number of its neighbors in $C$ is independent of the vertex. A Neumaier graph is a non-complete edge-regular graph with a regular clique. In this paper, we study vertex-transitive Neumaier graphs. We give a necessary and sufficient condition under which a vertex-transitive Neumaier graph is strongly regular. We also identify Neumaier Cayley graphs with small valency at most $10$ among vertex-transitive Neumaier graphs.

It has been accepted for publication in Transaction on Combinatorics journal