On Neumaier Cayley graphs | Sciact

On Neumaier Cayley graphs Full article

Journal

Discrete Mathematics
ISSN: 0012-365X , E-ISSN: 1872-681X

Output data

Year: 2027, Volume: 350, Number: 2, Article number : 115449, Pages count : 9 DOI: 10.1016/j.disc.2026.115449

Tags

Neumaier graphs, Cayley graphs, Difference sets

Authors

Evans Rhys J. ¹ , Goryainov Sergey ² , Ryabov Grigory ^2,3,4 , Zhao Da ⁵

Affiliations

1	University of Sydney
2	Hebei Normal University
3	Sobolev Institute of Mathematics
4	Novosibirsk State Technical University
5	East China University of Science and Technology

Funding (1)

Министерство науки и высшего образования РФ

FWNF-2026-0011

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.

Evans R.J. , Goryainov S. , Ryabov G. , Zhao D.
On Neumaier Cayley graphs
Discrete Mathematics. 2027. V.350. N2. 115449 :1-9. DOI: 10.1016/j.disc.2026.115449 Scopus

Submitted:	Feb 5, 2026
Accepted:	Sep 21, 2026
Published online:	Sep 29, 2026

≡ Scopus:

2-s2.0-105051592799