Embedding graphs onto the Supercube
From MaRDI portal
Publication:4419684
Recommendations
Cited in
(26)- Supercube: An optimally fault tolerant network architecture
- On the routing problem in faulty supercubes
- Hamilton-connectivity and cycle-embedding of the Möbius cubes
- An optimal embedding of cycles into incomplete hypercubes
- Embedding meshes into crossed cubes
- The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
- The m-pancycle-connectivity of a WK-recursive network
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Complete path embeddings in crossed cubes
- Embedding cycles in IEH graphs
- Cycles embedding in exchanged crossed cube
- scientific article; zbMATH DE number 1270449 (Why is no real title available?)
- Embedding cycles and meshes onto incomplete hypercubes
- EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE
- The bicube: an interconnection of two hypercubes
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles
- On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network
- Embedding meshes into twisted-cubes
- Routing properties of supercubes
- Optimal routing based on super topology in optical parallel interconnect
- Embedding of tori and grids into twisted cubes
- Topological properties of supercube
- Complete binary trees embeddings in Möbius cubes
- Embedding of cycles in twisted cubes with edge-pancyclic
- Embedding of meshes in Möbius cubes
- Embedding meshes into locally twisted cubes
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)