Embedding graphs onto the Supercube

DOI10.1109/12.376173zbMATH Open1040.68541OpenAlexW2047760643MaRDI QIDQ4419684FDOQ4419684

Authors: Adele A. Rescigno, Vittorio Scarano, V. Auletta 

Publication date: 1995

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

Full work available at URL: https://semanticscholar.org/paper/41440e87835025a594df8cf4e6c039e8d96fe4fb

Recommendations

• scientific article; zbMATH DE number 1270449
• Hypercube emulation of interconnection networks topologies
• Reconfiguring binary tree structures in a faulty supercube with unbounded expansion
• On the routing problem in faulty supercubes
• The bicube: an interconnection of two hypercubes

zbMATH Keywords

Hamiltonian cyclegraph embedding

Mathematics Subject Classification ID

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

Cited In (25)

• An optimal embedding of cycles into incomplete hypercubes
• The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
• Embedding cycles in IEH graphs
• Embedding of cycles in twisted cubes with edge-pancyclic
• Embedding meshes into locally twisted cubes
• Cycles embedding in exchanged crossed cube
• EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE
• Hamilton-connectivity and cycle-embedding of the Möbius cubes
• Routing properties of supercubes
• Supercube: An optimally fault tolerant network architecture
• Complete path embeddings in crossed cubes
• Embedding of meshes in Möbius cubes
• Embedding meshes into crossed cubes
• Topological properties of supercube
• The \(m\)-pancycle-connectivity of a WK-recursive network
• The bicube: an interconnection of two hypercubes
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Complete binary trees embeddings in Möbius cubes
• Embedding complete multi-partite graphs into Cartesian product of paths and cycles
• Embedding meshes into twisted-cubes
• On the routing problem in faulty supercubes
• Embedding of tori and grids into twisted cubes
• Optimal routing based on super topology in optical parallel interconnect
• On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network
• Embedding cycles and meshes onto incomplete hypercubes

This page was built for publication: Embedding graphs onto the Supercube

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