Abstract
Low-dimensional Tori are regularly used as interconnection networks in distributed-memory parallel computers. This paper investigates the fault-Hamiltonicity of two-dimensional Tori. A sufficient condition is derived for the graph Row-Torus(m, 2n + 1) with two faulty edges to have a Hamiltonian cycle, where m ≥ 3 and n ≥ 1. By applying the fault-Hamiltonicity of Row-Torus to a two-dimensional torus, we show that Torus(m, n), m, n ≥ 5, with at most four faulty edges is Hamiltonian if the following two conditions are satisfied: (1) the degree of every vertex is at least two, and (2) there do not exist a pair of nonadjacent vertices in a 4-cycle whose degrees are both two after faulty edges are removed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
