Toroidal Spectral Drawing

We give a deterministic drawing algorithm to draw a graph onto a torus, which is based on the usual spectral drawing algorithm. For most of the well-known toroidal vertex-transitive graphs, the result drawings give an embedding of the graphs onto the torus.

Automated summary

This study presents a deterministic algorithm for drawing graphs on a torus, based on the usual spectral drawing algorithm. For most well-known toroidal vertex-transitive graphs, the resulting drawings provide an embedding of the graphs onto the torus.