The standard double cover of a graph is the direct product . A graph is said to be stable if all the automorphisms of 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 approaches as , proving that almost all Cayley graphs of finite abelian groups are stable.

生成讲解博客的中文版本

生成AI智能校验的中文版本