Fault-free cycles passing through prescribed paths in hypercubes with faulty edges

DOI10.1016/J.AML.2008.08.021MaRDI QIDQ1023065zbMATH OpenOpenAlexFDO

Authors Chang-Hsiung Tsai

Publication date 10 June 2009

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2008.08.021

zbMATH Keywords

cycle embeddingedge fault toleranthypercubesinterconnection networksprescribed path

Mathematics Subject Classification ID

Paths and cycles (05C38) Applications of graph theory (05C90) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Cycles passing through a prescribed path in a hypercube with faulty edges
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model
• Cycles embedding in hypercubes with node failures
• Fault-tolerant cycles embedding in hypercubes with faulty edges

Cites work

• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• Path bipancyclicity of hypercubes

Cited in

(24)

• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
• Hamiltonian paths passing through prescribed edges in balanced hypercubes
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• An algorithm to construct independent spanning trees on parity cubes
• Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
• Path coverings with prescribed ends in faulty hypercubes
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
• Cycles passing through three prescribed edges in a hypercube
• Fault-free cycles passing through prescribed a linear forest in a hypercube with faulty edges.
• Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
• Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges
• The 2-path-bipanconnectivity of hypercubes
• Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
• scientific article; zbMATH DE number 6263048 (Why is no real title available?)
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Embedded paths and cycles in faulty hypercubes
• Hamiltonicity of hypercubes with faulty vertices
• Hamiltonian cycles passing through linear forests in k-ary n-cubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Cycles passing through a prescribed path in a hypercube with faulty edges
• Longest fault-free paths in hypercubes with vertex faults
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges

This page was built for publication: Fault-free cycles passing through prescribed paths in hypercubes with faulty edges

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