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

檔案

日期

2012-11-01

類型

期刊名稱

JOURNAL OF COMBINATORIAL OPTIMIZATION

卷期與頁次

第 24 卷第 4 期,頁 627–646

ISSN

1382-6905

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Teng, Y.-H., Tan, J. J. M., Tsay, C.-W., & Hsu, L.-H. (2012). The paths embedding of the arrangement graphs with prescribed vertices in given position. JOURNAL OF COMBINATORIAL OPTIMIZATION, 24(4), 627–646. https://doi.org/10.1007/s10878-011-9418-y

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/20305