Issue No.08 - August (1993 vol.42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.238494
<p>Arrangement graphs have been proposed as an attractive interconnection topology for large multiprocessor systems. The authors study these graphs by proving the existence of Hamiltonian cycles in any arrangement graph. They also prove that an arrangement graph contains cycles of all lengths ranging between 3 and the size of the graph. They show that an arrangement graph can be decomposed into node disjoint cycles in many different ways.</p>
cycles embeddings; arrangement graphs; interconnection topology; large multiprocessor systems; Hamiltonian cycles; node disjoint cycles; multiprocessor interconnection networks.
K. Day, A. Tripathi, "Embedding of Cycles in Arrangement Graphs", IEEE Transactions on Computers, vol.42, no. 8, pp. 1002-1006, August 1993, doi:10.1109/12.238494