A new variation on hypercubes with smaller diameter

DOI10.1016/0020-0190(93)90065-HzbMath0778.68013OpenAlexW2019575286MaRDI 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

hypercubediameterconnectivityHamiltonian cycleroutingcomplete binary tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Related Items (14)

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

Cites Work

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

This page was built for publication: A new variation on hypercubes with smaller diameter