Cycles passing through a prescribed path in a hypercube with faulty edges

DOI10.1016/J.IPL.2010.05.015MaRDI QIDQ765497zbMATH OpenOpenAlexFDO

Authors Xiebin Chen

Publication date 19 March 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2010.05.015

zbMATH Keywords

hypercubecycle embeddinginterconnection networksedge-fault-tolerancepath bipancyclicity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical problems of computer architecture (68M07)

Recommendations

• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• Embedded paths and cycles in faulty hypercubes
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Fault-tolerant cycles embedding in hypercubes with faulty edges
• Long paths and cycles in hypercubes with faulty vertices

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Edge-bipancyclicity of conditional faulty hypercubes
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• Graph theory
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Hamiltonian paths and cycles passing through a prescribed path in hypercubes
• On path bipancyclicity of hypercubes
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• Path bipancyclicity of hypercubes
• Path embedding in faulty hypercubes
• Survey on path and cycle embedding in some networks

Cited in

(13)

• scientific article; zbMATH DE number 6263048 (Why is no real title available?)
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• Spanning paths in hypercubes
• Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
• Cycles passing through three prescribed edges in a hypercube
• Cycles and paths embedded in varietal hypercubes
• A note on cycle embedding in hypercubes with faulty vertices
• Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• The 2-path-bipanconnectivity of hypercubes
• A note on path bipancyclicity of hypercubes
• Fault-free cycles passing through prescribed a linear forest in a hypercube with faulty edges.

This page was built for publication: Cycles passing through a prescribed path in a hypercube with faulty edges

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