pith. sign in

arxiv: 1512.00239 · v1 · pith:O4TVPYJAnew · submitted 2015-12-01 · 🧮 math.CO

On Color Preserving Automorphisms of Cayley Graphs of Odd Square-free Order

classification 🧮 math.CO
keywords graphgroupcayleyeverythenautomorphismnon-ccaorder
0
0 comments X
read the original abstract

An automorphism $\alpha$ of a Cayley graph $Cay(G,S)$ of a group $G$ with connection set $S$ is color-preserving if $\alpha(g,gs) = (h,hs)$ or $(h,hs^{-1})$ for every edge $(g,gs)\in E(Cay(G,S))$. If every color-preserving automorphism of $Cay(G,S)$ is also affine, then $Cay(G,S)$ is a CCA (Cayley color automorphism) graph. If every Cayley graph $Cay(G,S)$ is a CCA graph, then $G$ is a CCA group. Hujdurovi\'c, Kutnar, D.W. Morris, and J. Morris have shown that every non-CCA group $G$ contains a section isomorphic to the nonabelian group $F_{21}$ of order $21$. We first show that there is a unique non-CCA Cayley graph $\Gamma$ of $F_{21}$. We then show that if $Cay(G,S)$ is a non-CCA graph of a group $G$ of odd square-free order, then $G = H\times F_{21}$ for some CCA group $H$, and $Cay(G,S) = Cay(G,T)\Box\Gamma$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.