Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 12 Nov 2011 in math.CO and math.GR | (1111.2895v1)

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.$

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.