The k-degree Cayley graph and its topological properties

Sun Yuan Hsieh, Tien Te Hsiao

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)

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 languageEnglish
Pages (from-to)26-36
Number of pages11
JournalNetworks
Volume47
Issue number1
DOIs
Publication statusPublished - 2006 Jan

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'The k-degree Cayley graph and its topological properties'. Together they form a unique fingerprint.

Cite this