Hamilton Cycle The Cayley graph of Group

the tetrahedral group

A hamilton cycle passes through every vertex of a graph exactly once. A group is a set of elements and
generated by r and f
a consistent* way of combining them.
where
e.g. e.g. {0,1,2,3,4} with addition mod 5.
r 3= 1 = f 2
The Knight’s Tour Problem:
(rf)3 = 1
Can a knight visit every square of a chessboard in a round trip? + 0 1 2 3 4
r 0 0 1 2 3 4


st
cd
‰Š
yzy
+,+
;<
KL
f 1 1 2 3 4 0
50 11 24 63 14 37 26 35

!"!

WX
‹Œ
{{|
)*)
9:
IJ
23 62 51 12 25 34 15 38 2 2 3 4 0 1



gh
Ž
}~}
'('
78
GH
10 49 64 21 40 13 36 27 3 3 4 0 1 2
61 22 9 52 33 28 39 16 4 4 0 1 2 3

  
ST 
ij klk
uv [\[
€  ‚
%&% YY ZYY
56 343
EF CDC
48 7 60 1 20 41 54 29
satifying closure, associativity, identity and unique inverses
*
54 4 45 8 53 32 17 42 Cayley Graph

   

rqrq popo
baba `_`_
ˆ‡ˆ‡ †…†…
VUU VUU xww xww
--. --. 0// 0//
>= >= ?@ @?
NMNM OP PO
6 47 2 57 44 19 30 55

 
m nm
] ^]
ƒ „ƒ
## $##
11 211
A BA
QRQ
3 58 5 46 31 56 43 18 A Cayley graph has vertices and edges.
It has a vertex for each element of a group.
Here is a solution which also produces a magic square.
An edge shows two elements are related
Each row and column add to 260. by some given element called a generator.
Cayley graphs can be drawn with directed
or undirected edges.

The Cayley graph of a group

with 21 elements and
The Cayley graph of generators s and t
the Quartenion Group
generated by a and b s3 = 1
sts −1= t 2
a 2 =b 2 =(ab) 2
s
a
t
b

Hamilton cycle decomposition of Cayley graphs

PhD Candidate: Matthew Dean, supervised by Darryn Bryant and Peter Adams, Department of Mathematics, University of Queensland

The Cayley graph on the addition group Alspach’s conjecture Does every connected Cayley graph
mod 12 with generators 1 and 4 have a hamilton cycle?
Every 2k−regular connected Cayley graph
can be decomposed into
on a finite commutative group ...for commutative groups, yes.
two Hamilton cycles.
has a hamilton cycle ...for non−commutative groups
decomposition. this is not known.

In the wider class of vertex transitive

Alspach’s conjecture was proven true for the case k = 2 graphs, the Petersen graph
by Bermond, Favarn and Maheo (1989). does not have

a Hamilton

cycle.

Our Results

Theorem
All 6−regular Cayley graphs
which have a generator of Cayley graphs References
the same order as the group for addition mod 20
[1] R. Wilson and J. Watkins,

 
 
 



 

     
  





 efe





effeef

are decomposable into generated by 5 and 6. Graphs, an Intoductory Approach,

John Wiley & Sons. Inc, New York 1990

  

  
  

  
   
  
  





  

 
 


hamilton cycles.







 




[2] C Berge,Graphs,
North−Holland, Amsterdam 1991
Theorem
[3] I. Grossman and W Magus,
All 6−regular Cayley graphs Groups and their Graphs,
Mathematical Association of America, 1964
on an odd cyclic group
[4] S. Curran and J. Gallian,
are decomposable into Hamilton cycles and paths in Cayley
graphs and digraphs − A survey,
hamilton cycles. Discrete Mathematics 156 (1996) 1−18.