Abstract
In this paper, we present a new interconnection topology, called the[Formula: see text]-modified-bubble-sort graph, which is a generalization of the modified-bubble-sort graph. Additionally, we show many of its properties, such as its hierarchical structure, vertex transitivity, connectivity, edge-connectivity, super connectivity and super edge-connectivity. The [Formula: see text]-modified-bubble-sort graph presents more flexibility than the modified-bubble-sort graph in terms of its major design properties.
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 callMore From: International Journal of Foundations of Computer Science
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.
