Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Color Preserving Automorphisms of Cayley Graphs of Odd Square-free Order (1512.00239v1)

Published 1 Dec 2015 in math.CO

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$.

Summary

We haven't generated a summary for this paper yet.