Thijs van Veluw

A unified framework for existing and new constructions of Neumaier graphs

A Neumaier graph is a non-complete edge-regular graph containing a regular clique; it is called strictly Neumaier if it is not strongly regular. In this paper we present a construction using finite rings that unifies several known results and yields three new families, each containing infinitely many strictly Neumaier...