Abstract
A. A. Makhnev and M. S. Nirova found the intersection arrays of distance regular graphs with \(\lambda=2\) and at most 4096 vertices. For graphs of diameter \(4\), of most interest is the array \(\{21,18,12,4;1,1,6,21\}\) in this list. In this paper, we find the possible orders and fixed point subgraphs of the automorphisms of a distance regular graph with intersection array \(\{21,18,12,4;1,1,6,21\}\).
Similar content being viewed by others
References
A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs, in Ergeb. Math. Grenzgeb. (3) (Springer- Verlag, Berlin, 1989), Vol. 18.
A. A. Makhnev and M. S. Nirova, “On distance-regular graphs with \(\lambda=2\),” J. Sib. Fed. Univ. Math. Phys. 7 (2), 204–210 (2014).
P. J. Cameron, Permutation Groups, in London Math. Soc. Stud. Texts (Cambridge University Press, Cambridge, 1999), Vol. 45.
A. V. Zavarnitsine, “Finite simple groups with narrow prime spectrum,” Sib. Èlektron. Mat. Izv. 6, 1–12 (2009).
Funding
This work was supported by the Ministry of Science and Higher Education of the Russian Federation and Ural Federal University (contract no. 02. A03.21.0006 of 27.08.2013).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Makhnev, A.A. Automorphisms of a Distance Regular Graph with Intersection Array \(\{21,18,12,4;1,1,6,21\}\). Math Notes 109, 247–255 (2021). https://doi.org/10.1134/S0001434621010284
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434621010284