On the generic family of Cayley graphs of a finite group

Abstract

Let G be a finite group. For each m>1 we define the symmetric canonical subset S=S(m) of the Cartesian power Gm and we consider the family of Cayley graphs Gm(G)=Cay(Gm,S). We describe properties of these graphs and show that for a fixed m>1 and groups G and H the graphs Gm(G) and Gm(H) are isomorphic if and only if the groups G and H are isomorphic. We describe also the groups of automorphisms Aut(Gm(G)). It is shown that if G is a non-abelian group, then Aut(Gm(G)) (Gm Aut(G)) Dm+1, where Dm+1 is the dihedral group of order 2m+2. If G is an abelian group (with some exceptions for m=3), then Aut(Gm(G)) Gm (Aut(G)× Sm+1), where Sm+1 is the symmetric group of degree m+1. As an example of application we discuss relations between Cayley graphs Gm(G) and Bergman-Isaacs Theorem on rings with fixed-point-free group actions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…