A new variation on hypercubes with smaller diameter (Q685501): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The twisted N-cube with application to multiprocessing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4002466 / rank | |||
Normal rank | |||
Revision as of 10:33, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new variation on hypercubes with smaller diameter |
scientific article |
Statements
A new variation on hypercubes with smaller diameter (English)
0 references
22 March 1994
0 references
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\).
0 references
connectivity
0 references
Hamiltonian cycle
0 references
hypercube
0 references
diameter
0 references
routing
0 references
complete binary tree
0 references
