Abstract
A k‐regular hamiltonian and hamiltonian connected graph G is optimal fault‐tolerant hamiltonian and hamiltonian connected if G remains hamiltonian after removing at most k−2 nodes and/or edges and remains hamiltonian connected after removing at most k−3 nodes and/or edges. In this paper, we investigate a construction scheme to construct optimal fault‐tolerant hamiltonian and hamiltonian connected graphs. Hence, some of the generalized hypercubes, Twisted‐cubes, Crossed‐cubes, and Mobius cubes are optimal fault‐tolerant hamiltonian and optimal fault‐tolerant hamiltonian connected.
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 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.
