Using G&G

Last update=16 May, 2014


A good starting point for first-time users is the "G&G Help" menu, which contains descriptions of most of the functions of G&G.

Click for info on using G&G with

GraphIcon Graphs and Digraphs
GroupIcon Groups
ProjIcon Projective Configurations
TorusIcon Torus Maps
HexagonIcon Hexagon Maps
ProjMapIcon Projective Maps
SphereIcon Sphere Maps
PolyhedronIcon Polyhedra
PolytopeIcon 4D Polytopes
FractalIcon Fractals
nBodyIcon n-Body 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 of K5 and K3,3 constructed by G&G.

Vertex-Transitive Graphs

A graph is vertex-transitive 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.


G&G     Back to the Groups & Graphs home page.