A general construction of strictly Neumaier graphs and a related switching
Combinatorics
2023-02-14 v6
Abstract
We present a construction of Neumaier graphs with nexus 1, which generalises two known constructions of Neumaier graphs. We also use W. Wang, L. Qiu, and Y. Hu switching to show that we construct cospectral Neumaier graphs. Finally, we show that several small strictly Neumaier graphs can be obtained from our construction, and give a geometric or algebraic description for each of these graphs.
Cite
@article{arxiv.2109.13884,
title = {A general construction of strictly Neumaier graphs and a related switching},
author = {Rhys J. Evans and Sergey Goryainov and Elena V. Konstantinova and Alexander D. Mednykh},
journal= {arXiv preprint arXiv:2109.13884},
year = {2023}
}