The spined cube: a new hypercube variant with smaller diameter

DOI10.1016/J.IPL.2011.03.011zbMATH Open1260.68027DBLPjournals/ipl/ZhouFJZ11OpenAlexW2039097236WikidataQ60402488 ScholiaQ60402488MaRDI QIDQ1944950FDOQ1944950

Authors: Wujun Zhou, Jianxi Fan, Shukui Zhang, X.-H. 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

Recommendations

• A hypercube variant with small diameter
• A new variation on hypercubes with smaller diameter
• The locally twisted cubes
• A new family of bridged and twisted hypercubes
• The bicube: an interconnection of two hypercubes

zbMATH Keywords

diameterinterconnection networkBC graphspined cube

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

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
• The locally twisted cubes
• Logic and Computer Design in Nanospace

Cited In (15)

• A note on minimum linear arrangement for BC graphs
• Hamiltonian cycles and paths in faulty twisted hypercubes
• A Hypercube Variant with Small Diameter
• Exchanged folded crossed cube: a new interconnection network for parallel computation
• Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity
• Two-round diagnosability measures for multiprocessor systems
• The bicube: an interconnection of two hypercubes
• Connectivity and constructive algorithms of disjoint paths in dragonfly networks
• Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength
• The fault-diameter and wide-diameter of twisted hypercubes
• Embedding algorithm of spined cube into grid structure and its wirelength computation
• The wide-diameter of \(Z_{n, k}\)
• Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube
• An algorithm to construct independent spanning trees on parity cubes
• A new family of bridged and twisted hypercubes

This page was built for publication: The spined cube: a new hypercube variant with smaller diameter

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