Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the generic family of Cayley graphs of a finite group

Published 12 Nov 2019 in math.CO | (1911.05118v1)

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 $\mathscr{G}m(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 $\mathscr{G}_m(G)$ and $\mathscr{G}_m(H)$ are isomorphic if and only if the groups $G$ and $H$ are isomorphic. We describe also the groups of automorphisms $\mathbf{Aut}(\mathscr{G}_m(G))$. It is shown that if $G$ is a non-abelian group, then $\mathbf{Aut}(\mathscr{G}_m(G))\simeq \big(Gm \rtimes \mathbf{Aut}(G)\big)\rtimes D{m+1}$, where $D_{m+1}$ is the dihedral group of order $2m+2$. If $G$ is an abelian group (with some exceptions for $m=3$), then $\mathbf{Aut}(\mathscr{G}m(G))\simeq Gm\rtimes \big(\mathbf{Aut}(G)\times S{m+1}\big)$, where $S_{m+1}$ is the symmetric group of degree $m+1$. As an example of application we discuss relations between Cayley graphs $\mathscr{G}_m(G)$ and Bergman-Isaacs Theorem on rings with fixed-point-free group actions.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.