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

DOI10.1016/J.AML.2008.08.021zbMATH Open1200.05242OpenAlexW2085577088MaRDI QIDQ1023065FDOQ1023065

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

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

zbMATH Keywords

cycle embeddinghypercubesinterconnection networksedge fault tolerantprescribed path

Mathematics Subject Classification ID

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

Cites Work

• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Title not available (Why is that?)
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Path bipancyclicity of hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges

Cited In (24)

• Hamiltonicity of hypercubes with faulty vertices
• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Title not available (Why is that?)
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• 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
• Path coverings with prescribed ends in faulty hypercubes
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• 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
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
• Hamiltonian paths passing through prescribed edges in balanced hypercubes
• Cycles passing through three prescribed edges in a hypercube
• Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• The 2-path-bipanconnectivity of hypercubes
• Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges
• Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
• An algorithm to construct independent spanning trees on parity cubes
• Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges
• Fault-free cycles passing through prescribed a linear forest in a hypercube with faulty edges.
• Embedded paths and cycles in faulty hypercubes
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes

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)