This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Interconnection Networks Based on a Generalization of Cube-Connected Cycles
August 1985 (vol. 34 no. 8)
pp. 769-772
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.
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, Aug. 1985, doi:10.1109/TC.1985.1676627
Usage of this product signifies your acceptance of the Terms of Use.