On Neumaier Cayley graphs
Combinatorics
2026-02-24 v2
Abstract
In the present paper, we study Neumaier Cayley graphs. First, we give a criterion for a Cayley graph to be a Neumaier graph with a spread given by the cosets of a subgroup. Further, we construct a new infinite family of Neumaier Cayley graphs of unbounded nexus. Finally, we provide an algorithm for enumerating Neumaier Cayley graphs and computational results obtained by this algorithm.
Keywords
Cite
@article{arxiv.2602.05412,
title = {On Neumaier Cayley graphs},
author = {Rhys J. Evans and Sergey Goryainov and Grigory Ryabov and Da Zhao},
journal= {arXiv preprint arXiv:2602.05412},
year = {2026}
}
Comments
12 pages