Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Edge-pancyclic block-intersection graphs
Discrete Mathematics - Special volume: Designs and Graphs
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Hamiltonian Cycles with Prescribed Edges in Hypercubes
SIAM Journal on Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Processing Letters
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
Journal of Graph Theory
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Information Processing Letters
Some results on topological properties of folded hypercubes
Information Processing Letters
On the enhanced hyper-hamiltonian laceability of hypercubes
CEA'09 Proceedings of the 3rd WSEAS international conference on Computer engineering and applications
On path bipancyclicity of hypercubes
Information Processing Letters
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Hamiltonian paths and cycles passing through a prescribed path in hypercubes
Information Processing Letters
Cycles passing through a prescribed path in a hypercube with faulty edges
Information Processing Letters
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Information Processing Letters
A note on cycle embedding in hypercubes with faulty vertices
Information Processing Letters
Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube
Information Sciences: an International Journal
Hamiltonian cycles passing through linear forests in k-ary n-cubes
Discrete Applied Mathematics
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
Theoretical Computer Science
| Hi-index | 0.89 |
In this paper, we consider the problem of cycles passing through prescribed edges in an n-dimensional hypercube Qn with some faulty edges. We obtain the following result: Let n h ≥ 2,F⊂E(Qn) with |F| n-h, and E0⊂E(Qn\F with |E0|=h. If the subgraph induced by E0 consists of pairwise vertex-disjoint paths, then all edges of E0 lie on a cycle of every even length from 2h-1(n+1-h)+2(h-1) to 2n in the graph Qn-F. Moreover, if h=2, then the result is optimal in the sense that Qn contains (1) two edges such that any cycle in Qn passing through them is of length at least 2n, and (2) edge subsets E0 and F with |E0|=2,|F|=n-2 such that no Hamiltonian cycle passes through the two edges of E0 in Qn-F.