Abstract
Twisted hypercube-like networks (THLNs) are a large class of network topologies, which subsume some well-known hypercube variants. This paper is concerned with the longest cycle in an n -dimensional ( n -D) THLN with up to 2 n − 9 faulty elements. Let G be an n -D THLN, n ≥ 7 . Let F be a subset of V ( G ) ⋃ E ( G ) , | F | ≤ 2 n − 9 . We prove that G − F contains a Hamiltonian cycle if δ ( G − F ) ≥ 2 , and G − F contains a near Hamiltonian cycle if δ ( G − F ) ≤ 1 . Our work extends some previously known results.
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 callDisclaimer: 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.
