English

Automorphism group of the complete alternating group graph

Combinatorics 2017-08-29 v3

Abstract

Let SnS_n and AnA_n denote the symmetric group and alternating group of degree nn with n3n\geq 3, respectively. Let SS be the set of all 33-cycles in SnS_n. The \emph{complete alternating group graph}, denoted by CAGnCAG_n, is defined as the Cayley graph Cay(An,S)\mathrm{Cay}(A_n,S) on AnA_n with respect to SS. In this paper, we show that CAGnCAG_n (n4n\geq 4) is not a normal Cayley graph. Furthermore, the automorphism group of CAGnCAG_n for n5n\geq 5 is obtained, which equals to Aut(CAGn)=(R(An)Inn(Sn))Z2(AnSn)Z2\mathrm{Aut}(CAG_n)=(R(A_n)\rtimes \mathrm{Inn}(S_n))\rtimes \mathbb{Z}_2\cong (A_n\rtimes S_n)\rtimes \mathbb{Z}_2, where R(An)R(A_n) is the right regular representation of AnA_n, Inn(Sn)\mathrm{Inn}(S_n) is the inner automorphism group of SnS_n, and Z2=h\mathbb{Z}_2=\langle h\rangle, where hh is the map αα1\alpha\mapsto\alpha^{-1} (αAn\forall \alpha\in A_n).

Keywords

Cite

@article{arxiv.1605.06664,
  title  = {Automorphism group of the complete alternating group graph},
  author = {Xueyi Huang and Qiongxiang Huang},
  journal= {arXiv preprint arXiv:1605.06664},
  year   = {2017}
}

Comments

9 pages, 1 figure