On the generic family of Cayley graphs of a finite group

From MaRDI portal
Publication:6329048




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 mathscrGm(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 mathscrGm(G) and mathscrGm(H) are isomorphic if and only if the groups G and H are isomorphic. We describe also the groups of automorphisms mathbfAut(mathscrGm(G)). It is shown that if G is a non-abelian group, then , where Dm+1 is the dihedral group of order 2m+2. If G is an abelian group (with some exceptions for m=3), then , where Sm+1 is the symmetric group of degree m+1. As an example of application we discuss relations between Cayley graphs mathscrGm(G) and Bergman-Isaacs Theorem on rings with fixed-point-free group actions.











This page was built for publication: On the generic family of Cayley graphs of a finite group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6329048)