Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Lee Distance and Topological Properties of k-ary n-cubes
IEEE Transactions on Computers
Uniform Approach for Solving some Classical Problems on a Linear Array
IEEE Transactions on Parallel and Distributed Systems
Hamiltonian-like Properties of k-Ary n-Cubes
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Panconnectivity and edge-pancyclicity of 3-ary N-cubes
The Journal of Supercomputing
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
Weak-vertex-pancyclicity of (n, k)-star graphs
Theoretical Computer Science
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links
IEEE Transactions on Parallel and Distributed Systems
Bipanconnectivity and Bipancyclicity in k-ary n-cubes
IEEE Transactions on Parallel and Distributed Systems
Strongly Hamiltonian laceability of the even k-ary n-cube
Computers and Electrical Engineering
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Discrete Applied Mathematics
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Pancyclicity of k-ary n-cube networks with faulty vertices and edges
Discrete Applied Mathematics
Conditional connectivity of star graph networks under embedding restriction
Information Sciences: an International Journal
Hamiltonian path embeddings in conditional faulty k-ary n-cubes
Information Sciences: an International Journal
| Hi-index | 0.07 |
The k-ary n-cube has been one of the most popular interconnection networks for massively parallel systems. In this paper, we investigate the edge-bipancyclicity of k-ary n-cubes with faulty nodes and edges. It is proved that every healthy edge of the faulty k-ary n-cube with f"v faulty nodes and f"e faulty edges lies in a fault-free cycle of every even length from 4 to k^n-2f"v (resp. k^n-f"v) if k=4 is even (resp. k=3 is odd) and f"v+f"e=