English

On automorphisms of the double cover of a circulant graph

Combinatorics 2022-01-11 v1

Abstract

A graph XX is said to be "unstable" if the direct product X×K2X \times K_2 (also called the canonical double cover of XX) has automorphisms that do not come from automorphisms of its factors XX and K2K_2. It is "nontrivially unstable" if it is unstable, connected, and nonbipartite, and no two distinct vertices of X have exactly the same neighbors. We find three new conditions that each imply a circulant graph is unstable. (These yield infinite families of nontrivially unstable circulant graphs that were not previously known.) We also find all of the nontrivially unstable circulant graphs of order 2p2p, where pp is any prime number. Our results imply that there does not exist a nontrivially unstable circulant graph of order nn if and only if either nn is odd, or n<8n < 8, or n=2pn = 2p, for some prime number pp that is congruent to 33 modulo 44.

Keywords

Cite

@article{arxiv.2108.05893,
  title  = {On automorphisms of the double cover of a circulant graph},
  author = {Ademir Hujdurović and Đorđe Mitrović and Dave Witte Morris},
  journal= {arXiv preprint arXiv:2108.05893},
  year   = {2022}
}

Comments

25 pages (plus 8 pages of notes to aid the referee). Ancillary files include lists of the nontrivially unstable circulant graphs of order at most 50, together with MAGMA, sagemath, and Maple code to find these graphs