Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes

DOI10.1016/j.ipl.2019.01.002zbMath1446.68128OpenAlexW2909804297WikidataQ128596236 ScholiaQ128596236MaRDI QIDQ1730017

Yuxing Yang, Ling-Ling Zhang

Publication date: 11 March 2019

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

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

zbMATH Keywords

fault toleranceinterconnection networkmultiprocessor systemHamiltonian laceability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes ⋮ The reliability analysis based on the generalized connectivity in balanced hypercubes ⋮ The \(h\)-restricted connectivity of balanced hypercubes ⋮ Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links

Cites Work

• Unnamed Item
• Unnamed Item
• Two node-disjoint paths in balanced hypercubes
• Fault-tolerant Hamiltonian laceability of balanced hypercubes
• Hamiltonian paths passing through prescribed edges in balanced hypercubes
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• Matching preclusion for balanced hypercubes
• Path embeddings with prescribed edge in the balanced hypercube network
• Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
• Symmetric Property and Reliability of Balanced Hypercube

This page was built for publication: Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes