Abstract
Let Γ be an edge-symmetric distance-regular covering of a clique. Then the group G = Aut(Γ) acts twice transitively on the set Σ of antipodal classes. We propose a classification for the graphs based on the description of twice transitive permutation groups. This program is realized for a 1 = c 2. In this article we classify graphs in the case when the action of G on Σ is affine.
Similar content being viewed by others
References
Godsil C. D., Liebler R. A., and Praeger C. E., “Antipodal distance transitive covers of complete graphs,” European J. Combin., 19, No. 4, 455–478 (1998).
Brouwer A. E., Cohen A. M., and Neumaier A., Distance-Regular Graphs, Springer-Verlag, Berlin, Heidelberg, and New York (1989).
Makhnev A. A., Paduchikh D. V., and Tsiovkina L. Yu., “Edge-symmetric distance-regular coverings of cliques with λ = µ,” Dokl. Akad. Nauk, 448, No. 1, 22–27 (2013).
Cameron P. J., “Finite permutation groups and finite simple groups,” Bull. London Math. Soc., 13, No. 1, 1–22 (1981).
Cameron P. J., Permutation Groups, Cambridge Univ. Press, Cambridge (1999) (London Math. Soc. Student Texts; V. 45).
Gavrilyuk A. L. and Makhnev A. A., “Geodesic graphs with homogeneity conditions,” Dokl. Math., 78, No. 2, 743–745 (2008).
GAP-Groups, Algorithms and Programming. Version 4.4.12. 2008. (http://www.gap-system.org).
Mazurov V. D., “Minimal permutation representations of finite simple classical groups. Special linear, symplectic, and unitary groups,” Algebra and Logic, 32, No. 3, 142–153 (1993).
Liebeck M. W. and Saxl J., “The primitive permutation groups of odd degree,” J. London Math. Soc., 31, No. 2, 250–264 (1985).
Vasilyev V. A., “Minimal permutation representations of finite simple exceptional groups of types G2 and F4,” Algebra and Logic, 35, No. 6, 371–383 (1996).
Jones W. and Parshall B., “On the 1-cohomology of finite groups of Lie type,” in: Proc. Conf. Finite Groups/ eds. W. R. Scott, F. Gross, Academic Press, New York, 1976, pp. 313–327.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text Copyright © 2013 Makhnev A.A., Paduchikh D.V., and Tsiovkina L.Yu.
The authors were supported by the Russian Foundation for Basic Research (Grant 12-01-00012), the RFBRNSFC (Grant 12-01-91155), the Program of the Division of Mathematical Sciences of the Russian Academy of Sciences (Grant 12-T-1-1003), and the Joint Program of the Ural and Siberian Divisions of the Russian Academy of Sciences (Grant 12-C-1-1018) with the National Academy of Sciences of Belarus (Grant 12-C-1-1009).
__________
Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 54, No. 6, pp. 1353–1367, November–December, 2013.
Rights and permissions
About this article
Cite this article
Makhnev, A.A., Paduchikh, D.V. & Tsiovkina, L.Y. Edge-symmetric distance-regular coverings of cliques: The affine case. Sib Math J 54, 1076–1087 (2013). https://doi.org/10.1134/S0037446613060141
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0037446613060141