The alternating group graph is the undirected Cayley graph of the set of generators of the alternating group given by , , , , ..., , and , where
(1)
| |||
(2)
|
in permutation cycle notation (Jwo et al. 1993).
is a special case of the arrangement graph given by . This and other special cases are summarized in the following table and illustrated above.
is Hamiltonian (Jwo et al. 1993), and when is an integer, contains mutually independent (directed) Hamiltonian cycles (Su et al. 2012).
The independence ratios for with , 3, 4, 5, and 6 are 1, 1/3, 1/3, 1/3, and 1/3, but the value for is apparently not known (S. Wagon, pers. comm., Jul. 30, 2018).
Precomputed properties of alternating group graphs are available in the Wolfram Language as GraphData["AlternatingGroupGraph", n].