The paths embedding of the arrangement graphs with prescribed vertices in given position

Yuan-Hsiang Teng, Jiann-Mean Tan, Chey-Woei Tsay, Lih-Hsing Hsu

研究成果: Article同行評審

9 引文 斯高帕斯(Scopus)

摘要

Let n and k be positive integers with n-ka parts per thousand yen2. The arrangement graph A (n,k) is recognized as an attractive interconnection networks. Let x, y, and z be three different vertices of A (n,k) . Let l be any integer with . We shall prove the following existance properties of Hamiltonian path: (1) for n-ka parts per thousand yen3 or (n,k)=(3,1), there exists a Hamiltonian path R(x,y,z;l) from x to z such that d (R(x,y,z;l))(x,y)=l; (2) for n-k=2 and na parts per thousand yen5, there exists a Hamiltonian path R(x,y,z;l) except for the case that x, y, and z are adjacent to each other.
原文English
頁(從 - 到)627-646
頁數10
期刊Journal of Combinatorial Optimization
24
發行號4
DOIs
出版狀態Published - 九月 2012

指紋 深入研究「The paths embedding of the arrangement graphs with prescribed vertices in given position」主題。共同形成了獨特的指紋。

引用此