arXiv Analytics

Sign in

arXiv:2406.04559 [math.CO]AbstractReferencesReviewsResources

The automorphism groups of small affine rank 3 graphs

Jin Guo, Andrey V. Vasil'ev, Rui Wang

Published 2024-06-07Version 1

A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van Maldeghem, the full automorphism groups of these graphs (equivalently, the 2-closures of rank 3 groups) have not been explicitly described, though a lot of information on this subject is available. In the present note, we address this problem for the affine rank 3 graphs. We find the automorphism groups for finitely many relatively small graphs and show that modulo known results, this provides the full description of the automorphism groups of the affine rank 3 graphs, thus reducing the general problem to the case when the socle of the automorphism group is nonabelian simple.

Related articles: Most relevant | Search more
arXiv:2406.00678 [math.CO] (Published 2024-06-02)
On automorphism groups of binary cyclic codes
arXiv:1211.6261 [math.CO] (Published 2012-11-27)
Generating tuples of integers modulo the action of a permutation group and applications
arXiv:1704.04089 [math.CO] (Published 2017-04-13)
Equivariant division