Embedding of Cycles in Arrangement Graphs

Khaled Day, Anand Tripathi

Research output: Contribution to journalArticlepeer-review

70 Scopus citations


Arrangement graphs have been recently proposed as an attractive interconnection topology for large multiprocessor systems. In this correspondence, we further study these graphs by first proving the existence of Hamiltonian cycles in any arrangement graph. Secondly, we prove that an arrangement graph contains cycles of all lengths ranging between 3 and the size of the graph. Finally, we show that an arrangement graph can be decomposed into node disjoint cycles in many different ways.

Original languageEnglish (US)
Pages (from-to)1002-1006
Number of pages5
JournalIEEE Transactions on Computers
Issue number8
StatePublished - Aug 1993

Bibliographical note

Copyright 2015 Elsevier B.V., All rights reserved.


  • Arrangement graphs
  • Hamiltonian cycles
  • disjoint cycles
  • embeddings
  • interconnection networks
  • star graphs


Dive into the research topics of 'Embedding of Cycles in Arrangement Graphs'. Together they form a unique fingerprint.

Cite this