排列圖An;k過去曾被使用於平行網路上面的拓樸性質,並且有非常廣泛的研究。 在本篇文章中,我們將證明n ¡ k ¸ 3, k ¸ 2,An;k會包含k(n ¡ k)條相互獨立的漢米爾頓迴圈。 特別地來說,我們假設N =j V (An;k) j, v(i) 2 V (An;k)當1 · i · N而且hv(1); v(2); ¢ ¢ ¢ ; v(N); v(1)i是一條在An;k中的漢米爾頓迴圈,我們將證明An;k包含了k(n ¡ k)條相互獨立的漢米爾頓迴圈,並且表示成Cl = hv(1); vl(2); ¢ ¢ ¢ ; vl(N); v(1)i對所有的1 · l · k(n ¡ k),使得vl(i) 6= vl0 (i)對於所有2 · i · N的當l 6= l0。因為每個An;k在的點都有個鄰點,所以這是最佳的結果。
The arrangement graph An;k, has been used as the underlying topology for many practi- cal multicomputers, and has been extensively studied in the past. In this thesis, we will prove that any An;k where n ¡ k ¸ 3, k ¸ 2, contains k(n ¡ k) mutually independent hamiltonian cycles. More speci¯cally, let N =j V (An;k) j, v(i) 2 V (An;k) for 1 · i · N and hv(1); v(2); ¢ ¢ ¢ ; v(N); v(1)i be a hamiltonian cycle of An;k. We prove that An;k con- tains k(n ¡ k) hamiltonian cycles, denoted by Cl = hv(1); vl(2); ¢ ¢ ¢ ; vl(N); v(1)i for all 1 · l · k(n ¡ k), such that vl(i) 6= vl0 (i) for all 2 · i · N whenever l 6= l0 . The result is optimal since each vertex of An;k has exactly k(n ¡ k) neighbors.