Abstract:
Graph visualisation is an important field in Computer Science. The visu-
alisation of groups in the form of Cayley graphs has applications in the layout
of interconnected networks and mathematics. By using theoretical results from
group theory, we present two algorithms that take as input a Cayley graph
(G, S) and draws it in a layout that highlights the symmetry of the group and
is easily readable.