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

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

2011-11-12

arxiv.org/abs/1111.2895v1

Mathematics

Combinatorics

18

Scientific paper

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_n^q$ 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_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.$

Affiliated with

Also associated with

No associations

Rating

Maximum-Size Independent Sets and Automorphism Groups of Tensor Powers of the Even Derangement Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum-Size Independent Sets and Automorphism Groups of Tensor Powers of the Even Derangement Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum-Size Independent Sets and Automorphism Groups of Tensor Powers of the Even Derangement Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-2918