A Cayley graph over a group G is said to be central if its connection set is a normal subset of G. It is proved that for any two central Cayley graphs over explicitly given almost simple groups of order n, the set of all isomorphisms from the first graph onto the second can be found in time poly (n).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Babai, W. Kantor, and E. M. Luks, “Computational complexity and the classification of finite simple groups,” in: Proceedings of the 24th Ann. Symp. Found. Comput. Sci. (1983), pp. 162–171.
J. Bray, J. Holt, and D. Roney-Dougal, The Maximal Subgroups of the Low-Dimensional Finite Classical Groups, Cambridge University Press, Cambridge (2013).
P. J. Cameron, Permutation Groups, Cambridge University Press (1999).
J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, and R. A. Wilson, An ATLAS of Finite Groups, Oxford University Press, Oxford (1985).
F. Dalla Volta and A. Lucchini, “Generation of almost simple groups,” J. Algebra, 178, No. 1, 194–223 (1995).
S. Evdokimov and I. Ponomarenko, “Recognizing and isomorphism testing circulant graphs in polynomial time,” Algebra Analiz, 15, No. 6, 1–34 (2003).
S. Evdokimov and I. Ponomarenko, “Permutation group approach to association schemes,” European J. Combin., 30, 1456–1476 (2009).
S. Evdokimov and I. Ponomarenko, “Schurity of S-rings over a cyclic group and generalized wreath product of permutation groups,” Algebra Analiz, 24, No. 3, 84–127 (2012).
A. Ganesan, “Automorphism group of the complete transposition graph,” J. Algebraic Combin., 42, No. 3, 793–801 (2015).
C. H. Li, “On isomorphisms of finite Cayley graphs – a survey,” Discrete Math., 256, 301-334 (2002).
M. W. Liebeck, Ch. E. Praeger, and J. Saxl, “Regular subgroups of primitive permutation groups,” Memoirs Amer. Math. Soc., 203, No. 952, 1–88 (2010).
E. M. Luks, “Isomorphism of graphs of bounded valence can be tested in polynomial time,” J. Comp. Sys. Sci., 25, 42–65 (1982).
M. Muzychuk, “A solution of the isomorphism problem for circulant graphs,” Proc. London Math. Soc., 88, 1–41 (2004).
I. Ponomarenko, “Bases of Schurian antisymmetric coherent configurations and isomorphism test for Schurian tournaments,” J. Math. Sci., 192, No. 3, 316–338 (2013).
B. Weisfeiler (editor), “On Construction and Identification of Graphs,” Lecture Notes Math., 558 (1976).
H. Wielandt, Finite Permutation Groups, Academic press, New York-London (1964).
H. Wielandt, Permutation Groups Through Invariant Relations and Invariant Functions, Lect. Notes Dept. Math. Ohio St. Univ., Columbus (1969).
Author information
Authors and Affiliations
Corresponding author
Additional information
In memory of Sergei Evdokimov
Published in Zapiski Nauchnykh Seminarov POMI, Vol. 455, 2017, pp. 154–180.
Rights and permissions
About this article
Cite this article
Ponomarenko, I., Vasil’ev, A. Testing Isomorphism of Central Cayley Graphs Over Almost Simple Groups in Polynomial Time. J Math Sci 234, 219–236 (2018). https://doi.org/10.1007/s10958-018-3998-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-018-3998-3