Lobachevskii Journal of Mathematics

, Volume 39, Issue 3, pp 458–463 | Cite as

On Automorphisms of a Distance-Regular Graph with Intersection Array {125, 96, 1; 1, 48, 125}

Article
  • 4 Downloads

Abstract

J. Koolen posed the problem of studying distance-regular graphs in which the neighborhoods of vertices are strongly regular graphs whose second eigenvalue is at most t for a given positive integer t. This problem is reduced to the description of distance-regular graphs in which the neighborhoods of vertices are strongly regular graphs with a nonprincipal eigenvalue t for t = 1, 2,.... In the paper “Distance regular graphs in which local subgraphs are strongly regular graphs with the second eigenvalue at most 3”, Makhnev and Paduchikh found intersection arrays of distance-regular graphs in which the neighborhoods of vertices are strongly regular graphs with second eigenvalue t, where 2 < t ≤ 3. Graphs with intersection arrays {125, 96, 1; 1, 48, 125}, {176, 150, 1; 1, 25, 176}, and {256, 204, 1; 1, 51, 256} remained unexplored. In this paper, possible orders and fixed-point subgraphs of automorphisms are found for a distance-regular graph with intersection array {125, 96, 1; 1, 48, 125}. It is proved that the neighborhoods of the vertices of this graph are pseudogeometric graphs for GQ(4, 6). Composition factors of the automorphism group for a distance-regular graph with intersection array {125, 96, 1; 1, 48, 125} are determined.

Keywords

Distance-regular graph automorphism groups of a graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. A. Makhnev and D.V. Paduchikh, “Remotely regular graphs with strongly regular neighborhoods of vertices and the second eigenvalue not larger than 3,” Dokl. Akad. Nauk 464, 396–400 (2015).Google Scholar
  2. 2.
    A. E. Brouwer, A.M. Cohen, and A. Neumaier, Distance-Regular Graphs (Springer, New York, 1989).CrossRefMATHGoogle Scholar
  3. 3.
    P. J. Cameron, Permutation Groups, Vol. 45 of LondonMath. Soc. Student Texts (Cambridge Univ. Press, Cambridge, 1999).CrossRefMATHGoogle Scholar
  4. 4.
    A. L. Gavrilyuk and A. A. Makhnev, “On automorphisms of a remote graph with an intersection array {56, 45, 1; 1, 9, 56},” Dokl. Akad. Nauk 432, 583–587 (2010).MATHGoogle Scholar
  5. 5.
    A. V. Zavarnitsine, “Finite simple groups with narrow prime spectrum,” Sib. Elektron. Mat. Izv. 6, 1–12 (2009).MathSciNetMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2018

Authors and Affiliations

  1. 1.Khetagurov North Ossetian State UniversityVladikavkazRussia
  2. 2.Krasovskii Institute of Mathematics and Mechanics, Ural BranchRussian Academy of SciencesYekaterinburgRussia

Personalised recommendations