The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1985 vol.34)
pp: 769-772
G.E. Carlsson , Department of Mathematics, University of California
ABSTRACT
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.
INDEX TERMS
parallel processing architectures, Cayley graphs, communication networks, diameter, (d, k) graphs
CITATION
G.E. Carlsson, J.E. Cruthirds, H.B. Sexton, C.G. Wright, "Interconnection Networks Based on a Generalization of Cube-Connected Cycles", IEEE Transactions on Computers, vol.34, no. 8, pp. 769-772, August 1985, doi:10.1109/TC.1985.1676627
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool