Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
The Structure of Automorphism Groups of Cayley Graphs and Maps
Journal of Algebraic Combinatorics: An International Journal
Fault hamiltonicity of augmented cubes
Parallel Computing
The forwarding indices of augmented cubes
Information Processing Letters
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Hi-index | 0.00 |
A variation of the hypercube, the augmented cube AQn of dimension n is defined as follows. It has 2n vertices, each labelled by an n-bit binary string a1 a2···an. Define AQ1=K2. For n≥2, AQn is obtained by taking two copies [image omitted] and [image omitted] of AQn-1, with vertex sets [image omitted] , [image omitted] , and joining 0 a2 a3···an with 1 b2 b3···bn iff either (i) a2 a3···an=b2 b3···bn, or (ii) [image omitted] . In this paper, we observe that AQn is a Cayley graph and identify its automorphism group.