Cayley graphs

This page lists all the Cayley graphs on up to 31 vertices, but divided according to the group to which they belong. This may be important for some applications, otherwise this data is largely a repetition of data that can be found in the lists of transitive graphs.

The first group of each order is the cyclic group, then the remaining groups are ordered according to the lists in the book Group Tables by Thomas & Wood (this book omits the cyclic groups). They give some descriptive names, which I have stuck to (with the exception of using D(2n) for the dihedral group of order 2n, rather than D(n)). The cryptic names for the groups of order 16 come from Hall and Senior.

All graphs are in the graph6 format. If you are going to download large files, you may want to consider these points.

Each file contains only those graphs whose degree is less than n/2, connected or otherwise. If you want all the graphs, it will be necessary to find the complements. The numbers given in the table are the number of graphs in each file - usually this is half the number of Cayley graphs for that group, but if n = 4k+1 then the ones of degree 2k would get counted twice if we just doubled the number.

Cayley graphs on up to 31 vertices
Vertices Group # Group name Cayley Graphs
04 01 C(4) 2
04 02 C(2) x C(2) 2
05 01 C(5) 2
06 01 C(6) 4
06 02 Sym(3) 4
07 01 C(7) 2
08 01 C(8) 6
08 02 C(2) x C(4) 5
08 03 C(2) x C(2) x C(2) 5
08 04 D(8) 7
08 05 Q 4
09 01 C(9) 5
09 02 C(3) x C(3) 3
10 01 C(10) 10
10 02 D(10) 10
11 01 C(11) 4
12 01 C(12) 24
12 02 C(2) x C(6) 20
12 03 D(12) 32
12 04 Alt(4) 11
12 05 Q(6) 16
13 01 C(13) 9
14 01 C(14) 24
14 02 D(14) 28
15 01 C(15) 22
16 01 C(16) 42
16 02 C(2) x C(8) 44
16 03 C(4) x C(4) 21
16 04 C(2) x C(2) x C(4) 23
16 05 C(2) x C(2) x C(2) x C(2) 23
16 06 D(8) x C(2) 79
16 07 Q x C(2) 17
16 08 G_2 b 37
16 09 G_2 c_1 50
16 10 G_2 c_2 29
16 11 G_2 d 43
16 12 D(16) 102
16 13 G_3 a_2 58
16 14 Q(8) 26
17 01 C(17) 23
18 01 C(18) 96
18 02 C(6) x C(3) 35
18 03 Sym(3) x C(3) 71
18 04 D(18) 136
18 05 (C(3) x C(3)) semi C(2) 51
19 01 C(19) 30
20 01 C(20) 168
20 02 C(10) x C(2) 134
20 03 D(20) 470
20 04 Q(10) 72
20 05 Hol(C(5)) 132
21 01 C(21) 123
21 02 C(7) semi C(3) 33
22 01 C(22) 208
22 02 D(22) 408
23 01 C(23) 94
24 01 C(24) 656
24 02 C(2) x C(12) 656
24 03 C(6) x C(2) x C(2) 264
24 04 D(12) x C(2) 2276
24 05 Alt(4) x C(2) 929
24 06 Q(6) x C(2) 360
24 07 D(8) x C(3) 1016
24 08 Q x C(3) 224
24 09 Sym(3) x C(4) 1156
24 10 D(24) 3548
24 11 Q(12) 232
24 12 Sym(4) 1624
24 13 SL(2,3) 172
24 14 C(3) semi C(8) 312
24 15 C(3) semi D(8) 1844
25 01 C(25) 259
25 02 C(5) x C(5) 30
26 01 C(26) 700
26 02 D(26) 2052
27 01 C(27) 464
27 02 C(3) x C(9) 130
27 03 C(3) x C(3) x C(3) 15
27 04 (C(3) x C(3)) semi C(3) 48
27 05 C(9) semi C(3) 134
28 01 C(28) 1552
28 02 C(14) x C(2) 1104
28 03 D(28) 12892
28 04 Q(14) 400
29 01 C(29) 714
30 01 C(30) 4384
30 02 D(10) x C(3) 2752
30 03 D(6) x C(5) 2456
30 04 D(30) 20408
31 01 C(31) 1096
33 01 C(33) 6768



Home Gordon Royle, gordon@cs.uwa.edu.au, March 1998