Cayley graph and defining relations
The Cayley graph is a useful graphical representation of a small group. The relations of the group correspond to loops in the Cayley graph. The colouring algorithm is an effective means of determining deductions from a set of relations, and hence of determining a set of defining relations of the group.
The strategy we have followed for the colouring is the simplest one. It is also the one used in practical implementations. Its worst case cost is dominated by L×¦G¦2×¦S¦, where L is the total length of the defining relations.
Unable to display preview. Download preview PDF.