Paired many-to-many disjoint path covers of hypercubes with faulty edges

DOI10.1016/j.ipl.2011.10.010zbMath1233.68028OpenAlexW1984834024MaRDI QIDQ763493

Xie-Bin Chen

Publication date: 9 March 2012

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

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

zbMATH Keywords

hypercubefault toleranceinterconnection networkscoverHamiltonian pathvertex-disjoint paths

Mathematics Subject Classification ID

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

Related Items (16)

Paired many-to-many disjoint path covers in faulty hypercubes ⋮ Hamiltonian laceability in hypercubes with faulty edges ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Paired many-to-many disjoint path covers of the hypercubes ⋮ One-to-one disjoint path covers on alternating group graphs ⋮ THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ Many-to-many disjoint paths in hypercubes with faulty vertices ⋮ Hamiltonian paths in hypercubes with local traps ⋮ Paired many-to-many disjoint path covers of hypertori ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges ⋮ Hamiltonian cycles in hypercubes with more faulty edges ⋮ Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements ⋮ Changing the diameter of the locally twisted cube ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Long paths in hypercubes with a quadratic number of faults
• Many-to-many disjoint paths in faulty hypercubes
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• The two-equal-disjoint path cover problem of matching composition network
• Path partitions of hypercubes
• Path embedding in faulty hypercubes
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• Edge-fault-tolerant bipanconnectivity of hypercubes
• Long paths in hypercubes with conditional node-faults
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• A survey of the theory of hypercube graphs
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
• Spanning multi-paths in hypercubes
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements

This page was built for publication: Paired many-to-many disjoint path covers of hypercubes with faulty edges