Strongly Regular Graphs of Rank Four
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911239473463296 |
|---|---|
| author | Allen, William H. |
| author_facet | Allen, William H. |
| contents | Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the last few decades and often give rise to interesting groups of automorphisms. In this paper we take a reverse approach, and leverage strong classification results on rank four permutation groups to classify the strongly regular graphs which yield such groups as a group of automorphisms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_25410 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Strongly Regular Graphs of Rank Four Allen, William H. Group Theory Combinatorics 20B15, 20B25, 05E30, 05C25 Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the last few decades and often give rise to interesting groups of automorphisms. In this paper we take a reverse approach, and leverage strong classification results on rank four permutation groups to classify the strongly regular graphs which yield such groups as a group of automorphisms. |
| title | Strongly Regular Graphs of Rank Four |
| topic | Group Theory Combinatorics 20B15, 20B25, 05E30, 05C25 |
| url | https://arxiv.org/abs/2510.25410 |