Construction of maximum cycles in faulty binary hypercubes

DOI10.1007/S10513-005-0106-1MaRDI QIDQ2487580zbMATH OpenOpenAlexFDO

Authors P. P. Parkhomenko

Publication date 8 August 2005

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10513-005-0106-1

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Recommendations

• Embedded paths and cycles in faulty hypercubes
• Hamiltonian cycles in hypercubes with more faulty edges
• Hamiltonian cycles in hypercubes with faulty edges
• Long cycles in hypercubes with optimal number of faulty vertices
• scientific article; zbMATH DE number 5670007

Cites work

• scientific article; zbMATH DE number 4051623 (Why is no real title available?)
• Classification of the Hamiltonian cycles in binary hypercubes

Cited in

(2)

• Classification of the Hamiltonian cycles in binary hypercubes
• Path coverings with prescribed ends in faulty hypercubes

This page was built for publication: Construction of maximum cycles in faulty binary hypercubes

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