Fault-free Hamiltonian cycles in faulty arrangement graphs

Sun Yuan Hsieh, Gen Huey Chen, Chin Wen Ho

Research output: Contribution to journalArticle

113 Citations (Scopus)


The arrangement graph A n,k, which is a generalization of the star graph (n-k = 1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. The structure of the arrangement graph is reviewed and some necessary definitions and notations are introduced. It is shown that Hamiltonian cycles exist in the arrangement graph even when there are edge or vertex faults.

Original languageEnglish
Pages (from-to)223-237
Number of pages15
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number3
Publication statusPublished - 1999 Jan 1

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Fault-free Hamiltonian cycles in faulty arrangement graphs'. Together they form a unique fingerprint.

  • Cite this