E-resources
Peer reviewed
-
Hsieh, Sun-Yuan; Hsiao, Tien-Te
Networks, 01/2006, Volume: 47, Issue: 1Journal Article
This article introduces a new family of Cayley graphs, called k‐degree Cayley graphs, for building interconnection networks. The k‐degree Cayley graph possesses many valuable topological properties, such as regularity with degree k, logarithmic diameter, and maximal fault tolerance. We present an optimal shortest path routing algorithm for the k‐degree Cayley graph. Cycle‐embedding and clique‐embedding are also discussed. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 26–36 2006
