Topological Properties of Hypercubes
IEEE Transactions on Computers
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
Edge-pancyclic block-intersection graphs
Discrete Mathematics - Special volume: Designs and Graphs
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Graph Theory With Applications
Graph Theory With Applications
Edge-bipancyclicity of conditional faulty hypercubes
Information Processing Letters
| Hi-index | 0.00 |
In this paper, we consider the conditionally faulty hypercube Qn with n≥2 that each vertices of Qn is incident with at least m fault-free edges, 2≤m≤n−1. We shall generalize the limitation m≥2 in all previous results of edge-bipancyclicity. For every integer m, under the hypothesis, we prove that Qn is (n−2)-edge-fault-tolerant edge-bipancyclic, and the results are optimal with respect to the number of edge faults tolerated. This improves some known results on edge-bipancyclicity of hypercubes.