Abstract
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 language | English |
|---|---|
| Pages (from-to) | 1002-1006 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Computers |
| Volume | 42 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - 1993 |
Keywords
- Arrangement graphs
- disjoint cycles
- embeddings
- Hamiltonian cycles
- interconnection networks
- star graphs
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Hardware and Architecture
- Software
- Theoretical Computer Science
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'Embedding of Cycles in Arrangement Graphs'. Together they form a unique fingerprint.
Cite this
Day, K., & Tripathi, A. (1993). Embedding of Cycles in Arrangement Graphs. IEEE Transactions on Computers, 42(8), 1002-1006. https://doi.org/10.1109/12.238494