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
Embedding of tori and grids into twisted cubes
Theoretical Computer Science
Bipanconnectivity of balanced hypercubes
Computers & Mathematics with Applications
On pancyclicity properties of OTIS-mesh
Information Processing Letters
Pancyclicity of ternary n-cube networks under the conditional fault model
Information Processing Letters
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
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
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Theoretical Computer Science
Independent spanning trees in crossed cubes
Information Sciences: an International Journal
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
Hi-index | 0.01 |
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.