Interconnection Networks Based on a Generalization of Cube-Connected Cycles

DOI10.1109/TC.1985.1676627zbMath0572.94019OpenAlexW1973924721MaRDI QIDQ3690758

C. G. Wright, John E. Cruthirds, Gunnar Carlsson, H. B. Sexton

Publication date: 1985

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1985.1676627

zbMATH Keywords

communication networksCayley graphsparallel processing architectures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)

Related Items

On the diameter and bisector size of Cayley graphs ⋮ Broadcasting on recursively decomposable Cayley graphs ⋮ Degree- and time-constrained broadcast networks ⋮ Some topological properties of star connected cycles ⋮ Communication aspects of networks based on geometric incidence relations ⋮ Large fault-tolerant interconnection networks ⋮ Using semidirect products of groups to build classes of interconnection networks ⋮ Constructing the vertex-transitive graphs of order 24 ⋮ THE CUBE-OF-RINGS INTERCONNECTION NETWORK ⋮ Displacement operator based decompositions of matrices using circulants or other group matrices ⋮ Sparse networks tolerating random faults. ⋮ New methods for using Cayley graphs in interconnection networks ⋮ Application of coding theory to interconnection networks ⋮ Fault-tolerant Hamiltonian laceability of balanced hypercubes ⋮ A unified framework for off-line permutation routing in parallel networks ⋮ Forwarding index of cube-connected cycles ⋮ Exposing graph uniformities via algebraic specification ⋮ Node bisectors of Cayley graphs