The k-valent graph: A new family of cayley graphs for interconnection networks

Sun Yuan Hsieh, Tien Te Hsiao

研究成果: Conference contribution

4 引文 斯高帕斯(Scopus)

摘要

This paper introduces a new family of Cayley graphs, named the k-valent graphs, for building interconnection networks. It includes the trivalent Cayley graphs (Vadapalli and Srimani, 1995) as a subclass. These new graphs are shown to be regular with the node-degree k, to have logarithmic diameter subject to the number of nodes, and to be k-connected as well as maximally fault tolerant. We also propose a shortest path routing algorithm and investigate some algebraic properties like cycles or cliques embedding.

原文English
主出版物標題Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004
編輯R. Eigenmann
頁面206-213
頁數8
DOIs
出版狀態Published - 2004 十二月 17
事件Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004 - Montreal, Que, Canada
持續時間: 2004 八月 152004 八月 18

出版系列

名字Proceedings of the International Conference on Parallel Processing
ISSN(列印)0190-3918

Other

OtherProceedings - 2004 International Conference on Parallel Processing, ICPP 2004
國家Canada
城市Montreal, Que
期間04-08-1504-08-18

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Engineering(all)

指紋 深入研究「The k-valent graph: A new family of cayley graphs for interconnection networks」主題。共同形成了獨特的指紋。

  • 引用此

    Hsieh, S. Y., & Hsiao, T. T. (2004). The k-valent graph: A new family of cayley graphs for interconnection networks. 於 R. Eigenmann (編輯), Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004 (頁 206-213). (Proceedings of the International Conference on Parallel Processing). https://doi.org/10.1109/ICPP.2004.1327923