The k-degree Cayley graph and its topological properties

  • Authors:

  • Sun-Yuan Hsieh;Tien-Te Hsiao

  • Affiliations:

  • Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 701, Taiwan;Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 701, Taiwan

  • Venue:
  • Networks
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 26–36 2006