Abstract
We call a strongly regular graph with \(v = \left( {\begin{array}{*{20}c} m \\ 2 \\ \end{array} } \right)\) and k = 2(m − 2) a Higman graph. In Higman graphs, the parameter µ takes values 4, 6, 7, and 8. We find possible orders of automorphisms of Higman graphs with µ = 6 and study the structure of fixed-point subgraphs of these automorphisms.
Similar content being viewed by others
References
D. G. Higman, “Characterization of families of rank 3 permutation groups by the subdegrees. I,” Arch. Math. 21, 151–156 (1970).
M. W. Liebeck and J. Saxl, “The finite primitive permutation groups of rank 3,” Bull. London Math. Soc. 18(2), 165–172 (1986).
N. D. Zyulyarkina and A. A. Makhnev, “Automorphisms of semitriangular graphs with µ = 6,” Dokl. Math. 79(3), 373–376 (2009).
P. Cameron, Permutation Groups (Cambridge Univ. Press, Cambridge, 1999), Ser. London Math. Soc. Student Texts, Vol. 45.
A. A. Makhnev and A. A. Tokbaeva, “On automorphisms of a strongly regular graph with parameters (76, 35, 18, 14),” Trudy Inst. Mat. Mekh. UrO RAN 16(3), 185–194 (2010).
A. E. Brouwer and W. H. Haemers, “The Gewirtz graph: an exercize in the theory of graph spectra,” Europ. J. Combin. 14(5), 397–407 (1993).
M. Mačaj and J. Širáň, “Search for properties of the missing Moore graph,” Linear Algebra Appl. 432(9), 2381–2398 (2010).
E. Spence, “Regular two-graphs on 36 vertices,” Linear Algebra Appl. 226/228, 459–497 (1995).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © N.D. Zyulyarkina, A.A.Makhnev, 2014, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2014, Vol. 20, No. 2.
Rights and permissions
About this article
Cite this article
Zyulyarkina, N.D., Makhnev, A.A. Automorphisms of Higman graphs with µ = 6. Proc. Steklov Inst. Math. 289 (Suppl 1), 240–268 (2015). https://doi.org/10.1134/S0081543815050223
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0081543815050223