Using G&G
Last update=30 Apr, 2018
Click for info on using G&G with
 Graphs and Digraphs
 Groups
 Projective Configurations
 Torus Maps
 Hexagon Maps
 Projective Maps
 Sphere Maps
 Polyhedra
 4D Polytopes
 Fractals
 nBody Systems
 Combinatorial Designs
Click below for various pictures of graphs constructed by G&G.
Graph Embeddings
The torus embeddings shown here were constructed by G&G's Torus Layout algorithm.
The projective embeddings were constructed by G&G's Projective Layout algorithm, and then
adjusted by hand. There are also Klein bottle embeddings
constructed by G&G.
VertexTransitive Graphs
A graph is vertextransitive if every vertex can be mapped to any other vertex by some automorphism.
Most of the drawings of the graphs shown here were constructed by G&G's Draw Symmetric algorithm.
 The connected 8point vertextransitive graphs.
 The connected 9point vertextransitive graphs.
 The connected 10point vertextransitive graphs.
 The connected 11point vertextransitive graphs.
 The connected 12point, 3regular (18 edges) vertextransitive graphs, and their complements.
 The connected 12point, 4regular (24 edges) vertextransitive graphs, and their complements.
 The connected 12point, 5regular (30 edges) vertextransitive graphs, and their complements.
 The connected 13point vertextransitive graphs.
 The connected 14point 3regular and 4regular vertextransitive graphs, and their complements.
 The connected 14point 5regular vertextransitive graphs, and their complements.
 The connected 14point 6regular vertextransitive graphs, and their complements.
 The connected 15point 4regular vertextransitive graphs, and their complements.
 The connected 15point 6regular vertextransitive graphs, and their complements.
 The connected 16point vertextransitive graphs, and their complements.
 The connected 17point vertextransitive graphs, and their complements.
 The connected 19point vertextransitive graphs, and their complements.
Back to the Groups & Graphs home page.
