Abstract
The dual cubes were introduced as a better interconnection network than the hypercubes for large scale distributed memory multiprocessors. In this paper we introduce a generalization of these networks, called dual-cube-like networks, which preserve the basic structure of dual cubes and retain many of its topological properties. We investigate structural properties of these networks beyond simple measures such as connectivity. We prove that if up to kn−k(k+1)2 vertices are deleted from a dual-cube-like n-regular network, then the resulting graph will either be connected or will have a large component and small components having at most k−1 vertices in total, and this result is sharp for k≤n. As an application, we derive additional results such as the cyclic vertex-connectivity and the restricted vertex-connectivity of these networks.
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.
