English

Cayley graphs on abelian groups

Combinatorics 2014-05-09 v2

Abstract

Let AA be an abelian group and let ι\iota be the automorphism of AA defined by i:aa1i:a\mapsto a^{-1}. A Cayley graph Γ=Cay(A,S)\Gamma=\mathrm{Cay}(A,S) is said to have an automorphism group \emph{as small as possible} if Aut(Γ)=Ai\mathrm{Aut}(\Gamma)= A\rtimes\langle i\rangle. In this paper, we show that almost all Cayley graphs on abelian groups have automorphism group as small as possible, proving a conjecture of Babai and Godsil.

Keywords

Cite

@article{arxiv.1306.3747,
  title  = {Cayley graphs on abelian groups},
  author = {Edward Dobson and Pablo Spiga and Gabriel Verret},
  journal= {arXiv preprint arXiv:1306.3747},
  year   = {2014}
}
R2 v1 2026-06-22T00:34:42.555Z