Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel computation: models and methods
Parallel computation: models and methods
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Longest fault-free paths in star graphs with vertex faults
Theoretical Computer Science
Longest Fault-Free Paths in Star Graphs with Edge Faults
IEEE Transactions on Computers
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
The Mcube: a symmetrical cube based network with twisted links
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model
Journal of Systems Architecture: the EUROMICRO Journal
Fault hamiltonicity of augmented cubes
Parallel Computing
Embedding longest fault-free paths onto star graphs with more vertex faults
Theoretical Computer Science
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Hamiltonian laceability of bubble-sort graphs with edge faults
Information Sciences: an International Journal
Fault-tolerant pancyclicity of augmented cubes
Information Processing Letters
Node-disjoint paths in hierarchical hypercube networks
Information Sciences: an International Journal
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
The super connectivity of augmented cubes
Information Processing Letters
Hamiltonian connectivity of the WK-recursive network with faulty nodes
Information Sciences: an International Journal
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks
IEEE Transactions on Parallel and Distributed Systems
Constructing the nearly shortest path in crossed cubes
Information Sciences: an International Journal
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Long paths in hypercubes with a quadratic number of faults
Information Sciences: an International Journal
Long paths and cycles in hypercubes with faulty vertices
Information Sciences: an International Journal
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
Information Sciences: an International Journal
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
The panpositionable panconnectedness of augmented cubes
Information Sciences: an International Journal
Constructing edge-disjoint spanning trees in twisted cubes
Information Sciences: an International Journal
Bipanconnectivity of balanced hypercubes
Computers & Mathematics with Applications
Theoretical Computer Science
ω-wide diameters of enhanced pyramid networks
Theoretical Computer Science
Note: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
Theoretical Computer Science
Regular connected bipancyclic spanning subgraphs of hypercubes
Computers & Mathematics with Applications
Hamiltonian cycles in hypercubes with 2n-4 faulty edges
Information Sciences: an International Journal
Hamiltonian properties of honeycomb meshes
Information Sciences: an International Journal
Conditional edge-fault pancyclicity of augmented cubes
Theoretical Computer Science
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
| Hi-index | 0.08 |
The augmented cube is a variation of hypercubes, it possesses many superior properties. In this paper, we show that, for any n-dimensional augmented cube (n=3) with faulty edges up to 4n-8 in which each vertex is incident to at least two fault-free edges, there exists a fault-free Hamiltonian cycle. Our result is optimal with respect to the number of faulty edges tolerated.