Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Edge-pancyclicity of recursive circulants
Information Processing Letters
Fault hamiltonicity of augmented cubes
Parallel Computing
The forwarding indices of augmented cubes
Information Processing Letters
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes
Information Processing Letters
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Fault-tolerant pancyclicity of augmented cubes
Information Processing Letters
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
The super connectivity of augmented cubes
Information Processing Letters
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
Computers & Mathematics with Applications
Long paths and cycles in hypercubes with faulty vertices
Information Sciences: an International Journal
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Edge-fault-tolerant vertex-pancyclicity of augmented cubes
Information Processing Letters
| Hi-index | 5.23 |
The augmented cube AQ"n, proposed by Choudum and Sunitha [7], is a variation of the hypercube Q"n and possesses many superior properties that the hypercube does not contain. In this paper, we show that, any n-dimensional augmented cube with at most 4n-12 faulty edges contains cycles of lengths from 3 to 2^n under the condition that every node is incident with at least two fault-free edges, where n=3. Ma et al. [21] obtained the same result but with the number of faulty edges up to 2n-3. Our result improves Ma et al.@?s result in terms of the number of fault-tolerant edges.