Maximum-Size Independent Sets and Automorphism Groups of Tensor Powers of the Even Derangement Graphs
Combinatorics
2011-11-15 v1 Group Theory
Abstract
Let be the alternating group of even permutations of and the set of even derangements on Denote by the tensor product of copies of where the Cayley graph is called the even derangement graph. In this paper, we intensively investigate the properties of including connectedness, diameter, independence number, clique number, chromatic number and the maximum-size independent sets of By using the result on the maximum-size independent sets , we completely determine the full automorphism groups of
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