paper

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

arXiv:1512.00239

Abstract

An automorphism of a Cayley graph of a group with connection set is color-preserving if or for every edge . If every color-preserving automorphism of is also affine, then is a CCA (Cayley color automorphism) graph. If every Cayley graph is a CCA graph, then is a CCA group. Hujdurović, Kutnar, D.W. Morris, and J. Morris have shown that every non-CCA group contains a section isomorphic to the nonabelian group of order . We first show that there is a unique non-CCA Cayley graph of . We then show that if is a non-CCA graph of a group of odd square-free order, then for some CCA group , and .

16 pages