Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 26-36 |
Number of pages | 11 |
Journal | Networks |
Volume | 47 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2006 Jan |
All Science Journal Classification (ASJC) codes
- Software
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications