Vertex-transitive Neumaier graphs
Vertex-transitive Neumaier graphs
A graph $\Gamma$ 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 $\Gamma$ is called regular whenever for any vertex out of $C$, the number of its neighbors in …