English

On The automorphism groups of $us$-Cayley graphs

Group Theory 2021-05-13 v4

Abstract

Let GG be a finite abelian group written additively with identity 00, and Ω\Omega be an inverse closed generating subset of GG such that 0Ω0\notin \Omega. We say that Ω \Omega has the property \lq\lq{}usus\rq\rq{} (unique summation), whenever for every 0gG0 \neq g\in G if there are s1,s2,s3,s4Ωs_1,s_2,s_3, s_4 \in \Omega such that s1+s2=g=s3+s4s_1+s_2=g=s_3+s_4 , then we have {s1,s2}={s3,s4}\{s_1,s_2 \} = \{s_3,s_4 \}. We say that a Cayley graph Γ=Cay(G;Ω)\Gamma=Cay(G;\Omega) is a usus-Cayley graphCayley\ graph, whenever GG is an abelian group and the generating subset Ω\Omega has the property \lq\lq{}usus\rq\rq{}. In this paper, we show that if Γ=Cay(G;Ω)\Gamma=Cay(G;\Omega) is a usus-Cayley graphCayley\ graph, then Aut(Γ)=L(G)AAut(\Gamma)=L(G)\rtimes A, where L(G)L(G) is the left regular representation of GG and AA is the group of all automorphism groups θ\theta of the group GG such that θ(Ω)=Ω\theta(\Omega)=\Omega. Then, as some applications, we explicitly determine the automorphism groups of some classes of graphs including M\"{o}bius ladders and kk-ary nn-cubes.

Keywords

Cite

@article{arxiv.1910.12563,
  title  = {On The automorphism groups of $us$-Cayley graphs},
  author = {S. Morteza Mirafzal},
  journal= {arXiv preprint arXiv:1910.12563},
  year   = {2021}
}

Comments

12 pages, 1 figure