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

preprint2015arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.