Asymptotical results on the automorphism groups of canonical double cover of graphs
Bartłomiej Bychawski, Ademir Hujdurović, Đorđe Mitrović, Gabriel Verret
Source abstract
The canonical double cover of a graph is the direct product . A graph is stable if every automorphism of is induced by automorphisms of and , and unstable otherwise. We prove several asymptotic results on stable and unstable graphs. In particular, we show that the automorphism group of the canonical double cover of almost every graph has order , and consequently that almost all graphs are stable. We also prove that the dominant sources of instability are having twins and being disconnected, in that order, and that graphs arising from a known construction are the next step in this hierarchy.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.