English

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

Combinatorics 2011-11-15 v1 Group Theory

Abstract

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

Keywords

Cite

@article{arxiv.1111.2895,
  title  = {Maximum-Size Independent Sets and Automorphism Groups of Tensor Powers of the Even Derangement Graphs},
  author = {Yun-Ping Deng and Fu-Ji Xie and Xiao-Dong Zhang},
  journal= {arXiv preprint arXiv:1111.2895},
  year   = {2011}
}

Comments

18