Disjoint cycles in hypercubes with prescribed vertices in each cycle
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
3004 | en_US |
dc.citation.issue |
18 | en_US |
dc.citation.spage |
2992 | en_US |
dc.citation.volume |
161 | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Lin, Cheng-Kuan | en_US |
dc.contributor.author |
Tan, Jimmy J. M. | en_US |
dc.contributor.author |
Hsu, Lih-Hsing | en_US |
dc.contributor.author |
Kung, Tzu-Liang | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:33:24Z | |
dc.date.available |
2014-12-08T15:33:24Z | |
dc.date.issued |
2013-12-01 | en_US |
dc.description.abstract |
A graph G is spanning r-cyclable of order t if for any r nonempty mutually disjoint vertex subsets A(1), A(2) ,..., A(r) of G with vertical bar A(1) boolean OR A(2) boolean OR ... boolean OR A(r)vertical bar <= t, there exist r disjoint cycles C-1, C-2,...,Cr of G such that C-1 boolean OR C-2 boolean OR ... C-r spans G, and C-t contains A(i) for every i. In this paper, we prove that the n-dimensional hypercube Q(n) is spanning 2-cyclable of order n - 1 for n >= 3. Moreover, Q(n) is spanning k-cyclable of order k if k <= n - 1 for n >= 2. The spanning r-cyclability of a graph G is the maximum integer t such that G is spanning r-cyclable of order k for k = r, r + 1,..., t but is not spanning r-cyclable of order t + 1. We also show that the spanning 2-cyclability of Q(n) is n - for n >= 3. (C) 2013 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.dam.2013.07.004 | en_US |
dc.identifier.issn |
0166-218X | en_US |
dc.identifier.journal |
DISCRETE APPLIED MATHEMATICS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.dam.2013.07.004 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/23211 | |
dc.identifier.wosnumber |
WOS:000328235600021 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Spanning cycle | en_US |
dc.subject |
Hamiltonian cycle | en_US |
dc.subject |
Cyclable | en_US |
dc.subject |
Hypercube | en_US |
dc.subject |
Graph | en_US |
dc.title |
Disjoint cycles in hypercubes with prescribed vertices in each cycle | en_US |
dc.type |
Article | en_US |
檔案
- 000328235600021.pdf (1.09 MB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Lin, C.-K., Tan, J. J. M., Hsu, L.-H., & Kung, T.-L. (2013). Disjoint cycles in hypercubes with prescribed vertices in each cycle. DISCRETE APPLIED MATHEMATICS, 161(18), 2992–3004. https://doi.org/10.1016/j.dam.2013.07.004
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/23211