Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Edge-fault-tolerant node-pancyclicity of twisted cubes
Information Processing Letters
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Bipanconnectivity of balanced hypercubes
Computers & Mathematics with Applications
On pancyclicity properties of OTIS-mesh
Information Processing Letters
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Fault-tolerant edge-pancyclicity of locally twisted cubes
Information Sciences: an International Journal
A novel algorithm to embed a multi-dimensional torus into a locally twisted cube
Theoretical Computer Science
Hamiltonian properties of twisted hypercube-like networks with more faulty elements
Theoretical Computer Science
A note on cycle embedding in hypercubes with faulty vertices
Information Processing Letters
ω-wide diameters of enhanced pyramid networks
Theoretical Computer Science
Note: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
Theoretical Computer Science
Theoretical Computer Science
Regular connected bipancyclic spanning subgraphs of hypercubes
Computers & Mathematics with Applications
Edge-bipancyclicity of star graphs with faulty elements
Theoretical Computer Science
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Theoretical Computer Science
Panconnectivity of n-dimensional torus networks with faulty vertices and edges
Discrete Applied Mathematics
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
Independent spanning trees in crossed cubes
Information Sciences: an International Journal
Strong matching preclusion under the conditional fault model
Discrete Applied Mathematics
| Hi-index | 0.02 |
A graph $G$ is called Hamiltonian if there is a Hamiltonian cycle in $G$. The conditional edge-fault Hamiltonicity of a Hamiltonian graph $G$ is the largest $k$ such that after removing $k$ faulty edges from $G$, provided that each node is incident to at least two fault-free edges, the resulting graph contains a Hamiltonian cycle. In this paper, we sketch common properties of a class of networks, called Matching Composition Networks (MCNs), such that the conditional edge-fault Hamiltonicity of MCNs can be determined from the found properties. We then apply our technical theorems to determine conditional edge-fault Hamiltonicities of several multiprocessor systems, including $n$-dimensional crossed cubes, $n$-dimensional twisted cubes, $n$-dimensional locally twisted cubes, $n$-dimensional generalized twisted cubes, and $n$-dimensional hyper Petersen networks. Moreover, we also demonstrate that our technical theorems can be applied to network construction.