Almost all standard double covers of abelian Cayley graphs have smallest possible automorphism groups

TL;DR

This paper proves that as abelian groups grow large, almost all their Cayley graphs are stable, meaning their automorphism groups are as small as possible, which advances understanding of graph symmetry.

Contribution

It establishes that the proportion of stable Cayley graphs of abelian groups approaches 1 as the group order increases, providing a significant asymptotic classification.

Findings

Proportion of stable Cayley graphs tends to 1 as group order increases.

Almost all Cayley graphs of finite abelian groups are stable.

Provides asymptotic enumeration results for these graphs.

Abstract

The standard double cover of a graph $\Gamma$ is the direct product $\Gamma\times K_2$. A graph $\Gamma$ is said to be stable if all the automorphisms of $\Gamma\times K_2$ come from its factors. Although the study of stability has attracted significant attention, particularly regarding Cayley graphs of abelian groups, a complete classification remains elusive even for Cayley graphs of cyclic groups. In this paper, we study the asymptotic enumeration of both labeled and unlabeled Cayley graphs of abelian groups whose standard double cover has the smallest possible automorphism group. As a corollary, in both the labeled and unlabeled settings, we conclude that the proportion of stable Cayley graphs of an abelian group of order $r$ approaches $1$ as $r\rightarrow\infty$, proving that almost all Cayley graphs of finite abelian groups are stable.