Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
SIAM Journal on Discrete Mathematics
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Fault-tolerant pancyclicity of augmented cubes
Information Processing Letters
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Graph Theory
Embedding fault-free cycles in crossed cubes with conditional link faults
The Journal of Supercomputing
Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults
The Journal of Supercomputing
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
Information Sciences: an International Journal
Edge-fault-tolerant vertex-pancyclicity of augmented cubes
Information Processing Letters
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Pancyclicity of k-ary n-cube networks with faulty vertices and edges
Discrete Applied Mathematics
| Hi-index | 0.90 |
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 vertex 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 ternary n-cube networks and show that they are conditional (4n-5)-edge-fault pancyclic.