1 paper
Aida Abiad, Bart De Bruyn, Jozefien D'haeseleer +1
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 strongl…