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

preprint2011arXivOpen access

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\T_n^q$ the tensor product of qq copies of $A\T_n,$ where the Cayley graph $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\T_n^q$ including connectedness, diameter, independence number, clique number, chromatic number and the maximum-size independent sets of $A\T_n^q.$ By using the result on the maximum-size independent sets $A\T_n^q$, we completely determine the full automorphism groups of $A\T_n^q.$

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.