Interconnection Networks Based on a Generalization of Cube-Connected Cycles
Carlsson, Cruthirds, Sexton, Wright · IEEE Transactions on Computers · 1985
A generalization of the cube-connected cycles of Preparata and Vuillemin is described which retains the symmetry of these architectures while allowing for constructions of greater density and of arbitrary degree. These constructions are of a type known as Cayley graphs, and their analysis is greatly facilitated by the applicability of methods from abstract algebra.