World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

THE Qn,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS

    The star graph and the alternating group graph were introduced as competitive alternatives to the hypercube, and they are indeed superior over the hypercube under many measures. However, they do suffer from scaling issues. To address this, different generalizations, namely, the (n,k)-star graph and the arrangement graph were introduced to address this shortcoming. From another direction, the star graph was recognized as a special case of Cayley graphs whose generators can be associated with a tree. Nevertheless, all these networks appear to be very different and yet share many properties. In this paper, we will solve this mystery by providing a common generalization of all these networks. Moreover, we will show that these networks have strong connectivity properties.