On Neumaier Cayley graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917287586430976 |
|---|---|
| author | Evans, Rhys J. Goryainov, Sergey Ryabov, Grigory Zhao, Da |
| author_facet | Evans, Rhys J. Goryainov, Sergey Ryabov, Grigory Zhao, Da |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_05412 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Neumaier Cayley graphs Evans, Rhys J. Goryainov, Sergey Ryabov, Grigory Zhao, Da Combinatorics 05B10, 05C25, 05E30 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. |
| title | On Neumaier Cayley graphs |
| topic | Combinatorics 05B10, 05C25, 05E30 |
| url | https://arxiv.org/abs/2602.05412 |