Hamiltonian cycles of balanced hypercube with more faulty edges
Ting Lan, Huazhong L\"u

TL;DR
This paper proves the existence of fault-free Hamiltonian cycles in balanced hypercubes with more faulty edges than previously known, under certain conditions, enhancing the understanding of their fault tolerance.
Contribution
It improves existing bounds on the number of faulty edges in balanced hypercubes that still allow Hamiltonian cycles, considering degree and cycle constraints.
Findings
Hamiltonian cycle exists with up to 5n-7 faulty edges.
Fault tolerance is improved under degree and cycle restrictions.
Results extend the known fault tolerance bounds for balanced hypercubes.
Abstract
The balanced hypercube , a variant of the hypercube, is a novel interconnection network for massive parallel systems. It is known that the balanced hypercube remains Hamiltonian after deleting at most faulty edges if each vertex is incident with at least two edges in the resulting graph for all . In this paper, we show that there exists a fault-free Hamiltonian cycle in for with if the degree of every vertex in is at least two and there exists no -cycles in , which improves some known results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Advancements in Battery Materials · Advanced Optical Network Technologies
