On color-preserving automorphisms of Cayley graphs of odd square-free order

Abstract: An automorphism

a l p h a

of a Cayley graph

C a y (G, S)

of a group

G

with connection set

S

is color-preserving if

a l p h a (g, g s) = (h, h s)

or

(h, h s^{- 1})

for every edge

(g, g s) i n E (C a y (G, S))

. If every color-preserving automorphism of

C a y (G, S)

is also affine, then

C a y (G, S)

is a CCA (Cayley color automorphism) graph. If every Cayley graph

C a y (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

G a m m a

of

F_{21}

. We then show that if

C a y (G, S)

is a non-CCA graph of a group

G

of odd square-free order, then

G = H i m e s F_{21}

for some CCA group

H

, and

C a y (G, S) = C a y (G, T) B o x G a m m a

.

Recommendations

Cites work

Cited in

(5)

Describes a project that uses

Uses Software

This page was built for publication: On color-preserving automorphisms of Cayley graphs of odd square-free order