Abstract
Star, bubble-sort, pancake, and Rotator-Faber-Moore (RFM) graphs are well-known interconnection networks that have node symmetric, maximum fault tolerance and hierarchical partition properties. These graphs are widely assumed to improve the network cost of a hypercube. This study proposes embedding methods for a star graph and its variations, and provides an analysis of the relevant costs. Results show that a bubble-sort graph can be embedded in a star graph with dilation 3, and in a RFM graph with dilation 2, while a star graph can be embedded in a pancake graph with dilation 4. The results suggest that the embedding method developed for the bubble-sort graph can be simulated in star graphs and RFM graphs in constant time O(1).
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.
