Neumaier Cayley graphs
Combinatorics
2023-08-23 v1
Abstract
A Neumaier graph is a non-complete edge-regular graph with the property that it has a regular clique. In this paper, we study Neumaier Cayley graphs. We give a necessary and sufficient condition under which a Neumaier Cayley graph is a strongly regular Neumaier Cayley graph. We also characterize Neumaier Cayley graphs with small valency at most .
Keywords
Cite
@article{arxiv.2308.11572,
title = {Neumaier Cayley graphs},
author = {Mojtaba Jazaeri},
journal= {arXiv preprint arXiv:2308.11572},
year = {2023}
}
Comments
17 pages, 1 figure