next up previous

Algorithms for Group Actions Applied to Graph Generation

Thomas Grüner, Reinhard Laue, and Markus Meringer
Universität Bayreuth, Lehrstuhl II für Mathematik, D-95440 Bayreuth, Germany.

to be published in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Finkelstein/Kantor, published by the American Mathematical Society.


The generation of discrete structures up to isomorphism is interesting for theoretical as well as for practical purposes. Mathematicians want to look at and analyse structures and, for example, the chemical industry uses mathematical generators of isomers for structure elucidation. The example chosen in this paper for explaining general generation methods for representatives from group orbits, is a relatively far reaching and fast graph generator. It is intended to serve as a basis for the next more powerful version of a generator of chemical isomers.

Next: Introduction