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

## TL;DR

This paper proves that isomorphisms between central Cayley graphs over almost simple groups can be computed efficiently in polynomial time, advancing understanding of graph isomorphism problems in algebraic structures.

## Contribution

It establishes a polynomial-time algorithm for testing isomorphism of central Cayley graphs over explicitly given almost simple groups.

## Key findings

- Isomorphism testing is polynomial-time for these graphs.
- Algorithm explicitly given for almost simple groups.
- Advances the graph isomorphism complexity theory.

## Abstract

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).