TY - GEN
T1 - The k-valent graph
T2 - Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004
AU - Hsieh, Sun Yuan
AU - Hsiao, Tien Te
PY - 2004
Y1 - 2004
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/10044240513
UR - https://www.scopus.com/pages/publications/10044240513#tab=citedBy
U2 - 10.1109/ICPP.2004.1327923
DO - 10.1109/ICPP.2004.1327923
M3 - Conference contribution
AN - SCOPUS:10044240513
SN - 0769521975
T3 - Proceedings of the International Conference on Parallel Processing
SP - 206
EP - 213
BT - Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004
A2 - Eigenmann, R.
Y2 - 15 August 2004 through 18 August 2004
ER -