A new family of interconnection networks of odd fixed degrees

DOI10.1016/J.JPDC.2005.06.002MaRDI QIDQ2497746zbMATH OpenOpenAlexFDO

Authors Shuming Zhou, Ni Du, Baoxing Chen

Publication date 4 August 2006

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2005.06.002

zbMATH Keywords

Cayley graphdiameterembeddinginterconnection networkrouting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A study of odd graphs as fault-tolerant interconnection networks
• A new class of interconnection networks based on the alternating group
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• Topology of interconnection networks with given degree and diameter
• Two families of Cayley graph interconnection networks
• An observation on the bisectional interconnection networks

Cited in

(4)

• RVCCC: a new variational network of cube-connected cycles and its topological properties
• Embedding meshes into crossed cubes
• scientific article; zbMATH DE number 597594 (Why is no real title available?)
• Recursive cubes of rings as models for interconnection networks

This page was built for publication: A new family of interconnection networks of odd fixed degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497746)