Circulant graphs and spherical codes
Sueli I. R. Costa, João E. Strapasson, Rogério Monteiro de Siqueira, M. Muniz · 2006
Circulant graphs are homogeneous graphs with special properties which have been used to build interconnection networks for parallel computing. The association of circulant graphs to a spherical code in dimension 2k is presented here via the construction of an isomorphic graph supported by a lattice in Rk.