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.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below