Circulant graphs and tessellations on flat tori (Q1044617)

Circulant graphs are here considered as the vertices and edges of a tesselation of a \(k\)-dimensional torus by hypercubes. Conditions are provided for a quotient lattice to give rise to a circulant graph on flat torus, and it is shown that any circulant graph can be embedded in a flat torus. It is also proved via this geometrical interpretation that to each circulant graph with maximum density there corresponds a perfect code in the Lee space.