Groups & Graphs is a
software package for graphs, digraphs, graph embeddings, projective configurations, polyhedra, convex hulls,
combinatorial designs, automorphism groups, and fractals. Version 3.6.0 is now available, with a number of new features.
Click on News for the most recent info.
Andrew Chalaturnyk's Hamilton Cycle code is now available.
This is Ccode under the GNU licence which compiles to a unix tool to find
hamilton cycles very fast. Go to the Downloads page.
Current versions
Groups & Graphs 3.6.0 for OS X.
Click for info on using G&G. The overview contains sample windows for graphs, digraphs, groups, torus maps, projective maps, sphere maps, projective configurations, polyhedra, and fractals. It also contains pictures of some interesting graphs. Sources of information for some of the algorithms are also available.
Graph Theory Textbook
Many of the algorithms used by G&G are described in
the textbook Graphs, Algorithms, and Optimization by William Kocay and Donald L. Kreher, Chapman & Hall/CRC Press, Boca Raton, 2005. It is available from amazon.com.
Some Features of G&G

Visual graph/digraph editor;

Automorphism group;

Graph isomorphism algorithm;

Graph embeddings in the plane, sphere, torus, and projective plane;

Hamiltonian cycles, planarity test, planar layout, torus maps, sphere maps, projective maps;

Line graphs, neighbour graphs, bipartite doubles, distancek graphs, antipodal graphs;

Orbits, generators, elements of permutation groups;

Block systems, commutator subgroups, stabilisers, quotient groups, Sylow subgroups;

Cayley graphs, double cosets, normalizers, centralizers;

Pointline configurations in the real projective plane;

3D and 4D Polyhedra, Convex Hulls;

Fractals  Julia sets and the Mandelbrot set;

nBody simulations;
