Automorphism group of the complete alternating group graph

Xueyi Huang and Qiongxiang Huang

Applied Mathematics and Computation, 2017, vol. 314, issue C, 58-64

Abstract: Let Sn and An denote the symmetric group and alternating group of degree n with n ≥ 3, respectively. Let S be the set of all 3-cycles in Sn. The complete alternating group graph, denoted by CAGn, is defined as the Cayley graph Cay(An, S) on An with respect to S. In this paper, we show that CAGn (n ≥ 4) is not a normal Cayley graph. Furthermore, the automorphism group of CAGn for n ≥ 5 is obtained, which equals to Aut(CAGn)=(R(An)⋊Inn(Sn))⋊Z2≅(An⋊Sn)⋊Z2, where R(An) is the right regular representation of An, Inn(Sn) is the inner automorphism group of Sn, and Z2=〈h〉, where h is the map α↦α−1 (∀α ∈ An).

Keywords: Complete alternating group graph; Automorphism group; Normal Cayley graph (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317304605
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:314:y:2017:i:c:p:58-64

DOI: 10.1016/j.amc.2017.07.009

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().