Embedding meshes/tori in faulty crossed cubes

DOI10.1016/j.ipl.2010.04.007zbMath1234.68021MaRDI QIDQ765478

Qiang Dong, Xiaofan Yang, Yuan Yan Tang

Publication date: 19 March 2012

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

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

zbMATH Keywords

torus; interconnection networks; mesh; fault-tolerance; graph embedding; crossed cube

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

68M07: Mathematical problems of computer architecture

Related Items

Embedding complete multi-partite graphs into Cartesian product of paths and cycles, Embeddings of circulant networks, Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength, Embedding of hypercubes into necklace, windmill and snake graphs, One-to-one disjoint path covers on alternating group graphs, Bothway embedding of circulant network into grid, Multiple regular graph embeddings into a hypercube with unbounded expansion, Super spanning connectivity on WK-recursive networks, A linear time algorithm for embedding hypercube into cylinder and torus, Wirelength of embedding complete multipartite graphs into certain graphs, Embedding of hypercubes into sibling trees, Embedding of recursive circulants into certain necklace graphs, MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES

Cites Work

• Unnamed Item
• Node-pancyclicity and edge-pancyclicity of hypercube variants
• Conditional fault diameter of crossed cubes
• Fault-tolerant embedding of paths in crossed cubes
• Embedding a family of disjoint multi-dimensional meshes into a crossed cube
• Fault-tolerant cycle-embedding of crossed cubes
• Embedding a family of disjoint 3D meshes into a crossed cube
• Paths in Möbius cubes and crossed cubes
• Embedding meshes into crossed cubes
• Constructing the nearly shortest path in crossed cubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Complete path embeddings in crossed cubes