Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
SIAM Journal on Discrete Mathematics
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 circuit and linear array embeddings in faulty k-ary n-cubes
Journal of Parallel and Distributed Computing
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
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
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
Pancyclicity of ternary n-cube networks under the conditional fault model
Information Processing Letters
Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges
Information Sciences: an International Journal
Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption
IEEE Transactions on Parallel and Distributed Systems
Hamiltonian path embeddings in conditional faulty k-ary n-cubes
Information Sciences: an International Journal
| Hi-index | 0.04 |
A graph G is said to be f-fault p-pancyclic if after removing f faulty vertices and/or edges from G, the resulting graph contains a cycle of every length from p to |V(G)|. In this paper, we consider one of the most popular networks which is named k-ary n-cube, and show that it is (2n-2)-fault k-pancyclic if k=3 is odd. Finally, an example shows that our result is best possible in some sense.