Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
On the generalized twisted cube
Information Processing Letters
Parallel computation: models and methods
Parallel computation: models and methods
Recursive circulants and their embeddings among hypercubes
Theoretical Computer Science
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
SIAM Journal on Discrete Mathematics
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
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
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Fault-tolerant pancyclicity of augmented cubes
Information Processing Letters
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)
Theoretical Computer Science
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks
IEEE Transactions on Parallel and Distributed Systems
Embedding fault-free cycles in crossed cubes with conditional link faults
The Journal of Supercomputing
Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults
The Journal of Supercomputing
| Hi-index | 0.00 |
A graph $G$ is said to be conditional $k$-edge-fault pancyclic if after removing $k$ faulty edges from $G$, under the assumption that each node is incident to at least two fault-free edges, the resulting graph contains a cycle of every length from its girth to $|V(G)|$. In this paper, we consider the common properties of a wide class of interconnection networks, called restricted hypercube-like networks, from which their conditional edge-fault pancyclicity can be determined. We then apply our technical theorems to show that several multiprocessor systems, including $n$-dimensional locally twisted cubes, $n$-dimensional generalized twisted cubes, recursive circulants $G(2^{n},4)$ for odd $n$, $n$-dimensional crossed cubes, and $n$-dimensional twisted cubes for odd $n$, are all conditional $(2n-5)$-edge-fault pancyclic.