Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
432 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
414 | en_US |
dc.citation.volume |
198 | en_US |
dc.citation.woscount |
11 | |
dc.contributor.author |
Teng, Yuan-Hsiang | en_US |
dc.contributor.author |
Tan, Jimmy J. M. | en_US |
dc.contributor.author |
Hsu, Lih-Hsing | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:12:18Z | |
dc.date.available |
2014-12-08T15:12:18Z | |
dc.date.issued |
2008-04-15 | en_US |
dc.description.abstract |
The arrangement graph A(n,k) is a generalization of the star graph. It is more flexible in its size than the star graph. There are some results concerning hamiltonicity and pancyclicity of the arrangement graphs. In this paper, we propose a new concept called panpositionable hamiltonicity. A hamiltonian graph G is panpositionable if for any two different vertices x and y of G and for any integer l satisfying d(x,y) <= l <= vertical bar v(G)vertical bar - d(x,y), there exists a hamiltonian cycle C of G such that the relative distance between x and y on C is l. A graph G is panconnected if there exists a path of length l joining any two different vertices x and y with d(x,y) <= l <= vertical bar v(G)vertical bar - 1. We show that An, k is panpositionable hamiltonian and panconnected if k >= 1 and n - k >= 2. (c) 2007 Elsevier Inc. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.amc.2007.08.073 | en_US |
dc.identifier.issn |
0096-3003 | en_US |
dc.identifier.journal |
APPLIED MATHEMATICS AND COMPUTATION | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.amc.2007.08.073 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/9453 | |
dc.identifier.wosnumber |
WOS:000254254300037 | |
dc.language.iso |
en_US | en_US |
dc.subject |
arrangement graph | en_US |
dc.subject |
panpositionable hamiltonian | en_US |
dc.subject |
panconnected | en_US |
dc.subject |
interconnection network | en_US |
dc.title |
Panpositionable hamiltonicity and panconnectivity of the arrangement graphs | en_US |
dc.type |
Article | en_US |
檔案
- 000254254300037.pdf (434.9 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Teng, Y.-H., Tan, J. J. M., & Hsu, L.-H. (2008). Panpositionable hamiltonicity and panconnectivity of the arrangement graphs. APPLIED MATHEMATICS AND COMPUTATION, 198(1), 414–432. https://doi.org/10.1016/j.amc.2007.08.073
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/9453