On The automorphism groups of us-Cayley graphs
Abstract
Let G be a finite abelian group written additively with identity 0, and be an inverse closed generating subset of G such that 0 . We say that has the property us (unique summation), whenever for every 0 ≠ g∈ G if there are s1,s2,s3, s4 ∈ such that s1+s2=g=s3+s4 , then we have \s1,s2 \ = \s3,s4 \. We say that a Cayley graph =Cay(G;) is a us-Cayley\ graph, whenever G is an abelian group and the generating subset has the property us. In this paper, we show that if =Cay(G;) is a us-Cayley\ graph, then Aut()=L(G) A, where L(G) is the left regular representation of G and A is the group of all automorphism groups θ of the group G such that θ()=. Then, as some applications, we explicitly determine the automorphism groups of some classes of graphs including M\"obius ladders and k-ary n-cubes.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.