Abstract
The balanced hypercube, as a new variant of hypercube, has many desirable properties such as strong connectivity, high regularity and symmetry. The particular property of the balanced hypercube is that each processor has a backup processor sharing the same neighborhood. A Hamiltonian bipartite graph G=(V0∪V1,E) is said to be Hamiltonian laceable if there is a Hamiltonian path between any two vertices x∈V0 and y∈V1. It has been proved that the balanced hypercube BHn is Hamiltonian laceable for all n⩾1. In this paper, we have proved that after at most 2n-2 faulty edges occur, BHn remains Hamiltonian laceable for all n⩾2, this result is optimal with respect to the number of faulty edges can be tolerated in BHn.
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.
