Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks

DOI10.1080/00207160701684485MaRDI QIDQ3603584zbMATHOpenAlexFDO

Authors Cheng-Kuan Lin, Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu

Publication date 18 February 2009

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160701684485

zbMATH Keywords

HamiltonianHamiltonian connectedfolded Petersen cube networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fault-tolerant Hamiltonian connectedness of cycle composition networks
• Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
• Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
• Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
• scientific article; zbMATH DE number 6139910
• Fault-tolerant Hamiltonicity in a class of faulty meshes
• Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• Hamiltonian properties of twisted hypercube-like networks with more faulty elements
• Hamiltonian connectivity of the WK-recursive network with faulty nodes

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• A delay optimal coterie on the \(k\)-dimensional folded Petersen graph
• A recursively construction scheme for super fault-tolerant Hamiltonian graphs
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Fault-tolerant Hamiltonicity of twisted cubes
• Graph theory with applications
• On some super fault-tolerant Hamiltonian graphs
• Ring embedding in faulty pancake graphs
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI

Cited in

(6)

• Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
• Hamiltonian properties of twisted hypercube-like networks with more faulty elements
• On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem and its generalization

This page was built for publication: Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603584)