A new variation on hypercubes with smaller diameter
The paper presents a variation on the hypercube, denoted \(GQ_ n\) for Generalized Twisted Cube of dimension n, that contains many of the good properties of the hypercube with smaller diameter. For a given dimension \(n\), the new diameter is about \((2/3)n\). After discussing the basic properties of the \(GQ_ n\), an efficient routing algorithm is presented, and then \(GQ_ n\) is shown to be Hamiltonian. Also we show that the complete binary tree on \(2^ n-1\) nodes, which is not a subgraph of the \(n\)-dimensional hypercube, is a subgraph of the \(GQ_ n\).
- Minimum neighborhood in a generalized cube
- The shuffle-cubes and their generalization
- Algorithms for the fixed linear crossing number problem
- The fault-diameter and wide-diameter of twisted hypercubes
- Randomly twisted hypercubes
- The spined cube: a new hypercube variant with smaller diameter
- 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
- Tight Bounds on the Diameter of Gaussian Cubes
- scientific article; zbMATH DE number 140089 (Why is no real title available?)
- A new family of bridged and twisted hypercubes
- 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
- Randomly twisted hypercubes: between structure and randomness
- An upper bound for edge congestion and the exact wirelength of embedding onto BC graphs
- A note on diameter of acyclic directed hypercubes
- Cycle embedding of augmented cubes
This page was built for publication: A new variation on hypercubes with smaller diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685501)
