The spined cube: a new hypercube variant with smaller diameter
From MaRDI portal
Publication:1944950
DOI10.1016/j.ipl.2011.03.011zbMath1260.68027OpenAlexW2039097236WikidataQ60402488 ScholiaQ60402488MaRDI QIDQ1944950
Shukui Zhang, Wujun Zhou, Jianxi Fan, Xiao-Hua Jia
Publication date: 28 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.011
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)
Related Items (13)
Exchanged folded crossed cube: a new interconnection network for parallel computation ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ Connectivity and constructive algorithms of disjoint paths in dragonfly networks ⋮ The fault-diameter and wide-diameter of twisted hypercubes ⋮ Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity ⋮ Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ A note on minimum linear arrangement for BC graphs ⋮ The wide-diameter of \(Z_{n, k}\) ⋮ A Hypercube Variant with Small Diameter ⋮ The bicube: an interconnection of two hypercubes ⋮ Embedding algorithm of spined cube into grid structure and its wirelength computation ⋮ Two-round diagnosability measures for multiprocessor systems
Cites Work
- Efficient unicast in bijective connection networks with the restricted faulty node set
- Minimum neighborhood in a generalized cube
- Locally twisted cubes are 4-pancyclic.
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- A lower bound on the size of \(k\)-neighborhood in generalized cubes
- The Mobius cubes
- Logic and Computer Design in Nanospace
- The locally twisted cubes
This page was built for publication: The spined cube: a new hypercube variant with smaller diameter
