Theory, design, and display of circulant graphs.
Circulant graphs are cycles with regular short-cuts. For example, C(12,{1,3}) corresponds to a clock-face in which not only consecutive hours but also 3-hour intervals are joined by an edge. By listing the vertices in strange orders, like 1 2 3 6 5 4 7 8 9 12 11 10, one can give much more efficient drawings. The project aims to find such orderings using visual display to sift for candidates and to show results.
