Groups & Graphs is a
software package for graphs, digraphs, graph embeddings, projective configurations, polyhedra, convex hulls,
combinatorial designs, automorphism groups, and fractals. Version 3.2 is now available, with many new features.
Click on News for the most recent info.
Version 3.5 will be released soon (12/08). A universal binary that runs on both PowerPC and Intel Macs.

Current versions
Groups & Graphs 3.2.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;
-
Hamiltonian cycles, planarity test, planar layout, torus maps, sphere maps, projective maps;
-
Line graphs, neighbour graphs, bipartite doubles, distance-k graphs, antipodal graphs;
-
Orbits, generators, elements of permutation groups;
-
Block systems, commutator subgroups, stabilisers, quotient groups, Sylow subgroups;
-
Cayley graphs, double cosets, normalizers, centralizers;
-
Point-line configurations in the real projective plane;
-
3D Polyhedra, Convex hulls;
-
Fractals -- Julia sets and the Mandelbrot set;
|