paper

On Cayley representations of central Cayley graphs over almost simple groups

arXiv:2112.05838 · doi:10.1007/s10801-022-01166-7

Abstract

A Cayley graph over a group is said to be central if its connection set is a normal subset of . We prove that every central Cayley graph over a simple group has at most two pairwise nonequivalent Cayley representations over associated with the subgroups of induced by left and right multiplications of . We also provide an algorithm which, given a central Cayley graph over an almost simple group whose socle is of a bounded index, finds the full set of pairwise nonequivalent Cayley representations of over in time polynomial in size of .

10 pages