Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time

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 $\mathrm{poly}(n)$.