A new variation on hypercubes with smaller diameter

DOI10.1016/0020-0190(93)90065-HzbMath0778.68013MaRDI QIDQ685501

Fouad B. Chedid, Riad B. Chedid

Publication date: 22 March 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90065-h

zbMATH Keywords

hypercube; diameter; connectivity; Hamiltonian cycle; routing; complete binary tree

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M07: Mathematical problems of computer architecture

Related Items

The locally twisted cubes, A Hypercube Variant with Small Diameter, Linear layout of locally twisted cubes, Augmented \(k\)-ary \(n\)-cubes, On the generalized twisted cube, On generalized twisted cubes, Cycle embedding of augmented cubes, Minimum neighborhood in a generalized cube, Algorithms for the fixed linear crossing number problem, The fault-diameter and wide-diameter of twisted hypercubes, Randomly twisted hypercubes, Hamiltonian properties on the class of hypercube-like networks, A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model, A lower bound on the size of \(k\)-neighborhood in generalized cubes

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• The twisted N-cube with application to multiprocessing