Paperlane

no. 3 · Tuesday 27 October 2026

On the isomorphism problem of Cayley digraphs

Péter P. Pálfy

math.GR · 7 pp

Abstract

A finite group $G$ is called a DCI-group provided any two Cayley digraphs $Cay(G,S)$ and $Cay(G,T)$ are isomorphic iff the two connection sets $S$ and $T$ are images of each other via automorphisms of the group $G$. Building on the vast literature on CI- and DCI-groups we present an updated list of possible DCI-groups. In addition, we give an alternative proof that does not rely on deep results from group theory. We also point out the three most important open problems related to the classification of DCI-groups.

comments
7 pages
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2610.33692 ↗