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 .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.