The VertexTransitive Graphs on 17 Vertices
Last update=21 Feb, 2009
There are 35 connected vertextransitive graphs on 17 vertices. The three that are selfcomplementary are shown here.
The order of the automorphism group is given in square brackets in each window's title.
Notation:
 C_{n} means the cycle of length n
 C_{n}(k)^{ } means the cycle of length n with chords of length k
 ~G^{ }_{ } means the complement of G
 The suffix SC on a graph means selfcomplementary.
 Paley(n) means the Paley graph on n vertices, where n is a prime power congruent to 1, (mod 4).
It has vertices 1,2,...,n,
and all edges [i,j] such that ij is a perfect square in GF(n).
The Paley graphs are always selfcomplementary.
Back to the Groups & Graphs home page.
