DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph
DOI10.1016/j.tcs.2013.06.001zbMath1296.68014OpenAlexW2077645128MaRDI QIDQ391194
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.06.001
hypercubeinterconnection networkshierarchical networkscompound graphdisc-ring graphvariants of hypercube
Network design and communication in computer systems (68M10) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- KCube: a novel architecture for interconnection networks
- On the metric dimension of circulant graphs
- Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
- Fault-tolerant Hamiltonicity of twisted cubes
- Edge-fault-tolerant node-pancyclicity of twisted cubes
- New algorithm for constructing fault-tolerant solutions of the circulant graph configuration
- Locally twisted cubes are 4-pancyclic.
- Topological properties of twisted cube
- Efficient domination in circulant graphs
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Radio numbers for generalized prism graphs
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Thek-degree Cayley graph and its topological properties
- Sum coloring of distance and circulant graphs
- Generalized de Bruijn digraphs
- The Mobius cubes
- The locally twisted cubes
- Augmented cubes
- Cycles in butterfly graphs
- Leveraging a Compound Graph-Based DHT for Multi-Attribute Range Queries with Performance Analysis