Maximum-Size Independent Sets and Automorphism Groups of Tensor Powers of the Even Derangement Graphs
Abstract: Let $A_n$ be the alternating group of even permutations of $X:={1,2,...,n}$ and ${\mathcal E}_n$ the set of even derangements on $X.$ Denote by $A\T_nq$ the tensor product of $q$ 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_nq$ including connectedness, diameter, independence number, clique number, chromatic number and the maximum-size independent sets of $A\T_nq.$ By using the result on the maximum-size independent sets $A\T_nq$, we completely determine the full automorphism groups of $A\T_nq.$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.