Issue No. 08 - August (1985 vol. 34)
G.E. Carlsson , Department of Mathematics, University of California
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.
parallel processing architectures, Cayley graphs, communication networks, diameter, (d, k) graphs
J. Cruthirds, H. Sexton, G. Carlsson and C. Wright, "Interconnection Networks Based on a Generalization of Cube-Connected Cycles," in IEEE Transactions on Computers, vol. 34, no. , pp. 769-772, 1985.