Möbius-deBruijn: the product of Möbius cube and deBruijn digraph

DOI10.1016/J.IPL.2011.10.023zbMATH Open1250.68064OpenAlexW2054718558MaRDI QIDQ413291FDOQ413291

Authors Deke Guo, Guiming Zhu, Hai Jin, Panlong Yang, Yingwen Chen, Xianqing Yi, Junxian Liu

Publication date 4 May 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.10.023

zbMATH Keywords

diameterfault toleranceinterconnection networksproduct graphKautz digraphrouting algorithmdeBruijn digraphMöbius cube

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Recommendations

• The Mobius cubes
• Hamilton-connectivity and cycle-embedding of the Möbius cubes
• scientific article; zbMATH DE number 434694
• A link between the hypercube and the Möbius cube
• KMcube: the compound of Kautz digraph and Möbius cube

Cites work

• Fault-tolerant networks based on the de Bruijn graph
• KCube: a novel architecture for interconnection networks
• The Mobius cubes
• The fastcube: A variation on hypercube topology with lower diameter
• Viceroy, a scalable and dynamic emulation of the butterfly

Cited in

(2)

• KMcube: the compound of Kautz digraph and Möbius cube
• scientific article; zbMATH DE number 434694 (Why is no real title available?)

This page was built for publication: Möbius-deBruijn: the product of Möbius cube and deBruijn digraph

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