The VertexTransitive Graphs on 14 Vertices
Last update=23 May, 2006
There are 51 connected vertextransitive graphs on 14 vertices. The 6 of degree 5 (hence 35 edges) 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}^{+} means the cycle of length n with diagonals
 C_{n}(k)^{ } means the cycle of length n with chords of length k
 C_{n}(k^{+})^{ } means the cycle of length n with chords of length k from every second vertex
 ~G^{ }_{ } means the complement of G
 2G^{ }_{ } means two disjoint copies of G
 GxH^{ }_{ } means the direct product of G and H
 Prism(m)^{ } means C_{m}xK_{2}, ie, two cycles with corresponding vertices joined by a matching
 L(G)^{ }_{ } means the linegraph of G
 Dbl(G)^{ }_{ } means the double of G. Make 2 copies of G, call them G_{1} and G_{2}. If uv is an edge of G, then u_{1}v_{2} and v_{1}u_{2} are also edges of Dbl(G)
 Dbl^{+}(G)^{ }_{ } means the double of G, with the additional edges u_{1}u_{2}
The complements of the graphs shown here are:
 VT12_33 = ~(C_{7}(2)xK_{2})
 VT12_34 = ~Dbl^{+}(C_{7})
 VT12_35 = ~C_{14}(2)
 VT12_36 = ~C_{14}(2,5^{+})
 VT12_37 = ~C_{14}^{+}(4)
 VT12_38 = ~C_{14}^{+}(3)
Back to the Groups & Graphs home page.
