Journal
PARALLEL PROCESSING LETTERS
Volume 23, Issue 3, Pages -Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0129626413500114
Keywords
Interconnection networks; Cayley graphs; (n, k)-star graphs; arrangement graphs; connectivity
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available