Maximum-Size Independent Sets and Automorphism Groups of Tensor Powers of the Even Derangement Graphs

Abstract

Let An be the alternating group of even permutations of X:=\1,2,...,n\ and En the set of even derangements on X. Denote by Anq the tensor product of q copies of An, where the Cayley graph An:=(An, En) is called the even derangement graph. In this paper, we intensively investigate the properties of Anq including connectedness, diameter, independence number, clique number, chromatic number and the maximum-size independent sets of Anq. By using the result on the maximum-size independent sets Anq, we completely determine the full automorphism groups of Anq.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…