Constructing symmetric drawings of graphs is NP-hard.In this paper, we present a new method for drawing graphs symmetrically
based on group theory.More formally, we define a n-geometric automorphism group of a graph that can be displayed as symmetries of a drawing of the graph in n dimensions.Then we present an algorithm to find all 2- and 3-geometric automorphism groups of a graph.We implement the algorithm using Magma [11] and the experimental results shows that our approach is very efficient in practice.W e also present a drawing algorithm
to display a 2- or 3-geometric automorphism group.
This research has been supported by a grant from the Australian Research Council. Full version of this paper is available
from http://www.cs.usyd.edu.au/~shhong/publication.htm [1].