Abstract
The bubble-sort star graph is an interconnection network for multiprocessor systems. Recursive structure is important for interconnection networks, since it can reduce the complex cases into simple cases, and it can keep good properties independent of dimensions. Many algorithms use the idea of recursive construction. Edge-disjoint Hamiltonian cycles not only provide the basis of all-to-all broadcasting algorithm for networks but also provide a replaceable Hamiltonian cycle for transmission when the other Hamiltonian cycle contains faulty edges in an interconnection network. In this paper, we propose the recursive definition of bubble-sort star graphs. Then as an application, we obtain two edge-disjoint Hamiltonian cycles of bubble-sort star graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computer Mathematics: Computer Systems Theory
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.