The super laceability of the hypercubes
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
21 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
15 | en_US |
dc.citation.volume |
92 | en_US |
dc.citation.woscount |
25 | |
dc.contributor.author |
Chang, CH | en_US |
dc.contributor.author |
Lin, CK | en_US |
dc.contributor.author |
Huang, HM | en_US |
dc.contributor.author |
Hsu, LH | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:37:26Z | |
dc.date.available |
2014-12-08T15:37:26Z | |
dc.date.issued |
2004-10-16 | en_US |
dc.description.abstract |
A k-container C(u, v) of a graph G is a set of k disjoint paths joining u to v. A k-container C(u, v) is a k*-container if every vertex of G is incident with a path in C(u, v). A bipartite graph G is k*-laceable if there exists a k*-container between any two vertices u, v from different partite set of G. A bipartite graph G with connectivity k is super laceable if it is i*-laceable for all i less than or equal to k. A bipartite graph G with connectivity k is f-edge fault-tolerant super laceable if G - F is i*-laceable for any 1 less than or equal to i less than or equal to k - f and for any edge subset F with F = f < k - 1. In this paper, we prove that the hypercube graph Q(r) is super laceable. Moreover, Qr is f-edge fault-tolerant super laceable for any f less than or equal to r - 2. (C) 2004 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.ipl.2004.06.006 | en_US |
dc.identifier.issn |
0020-0190 | en_US |
dc.identifier.journal |
INFORMATION PROCESSING LETTERS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.ipl.2004.06.006 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/25752 | |
dc.identifier.wosnumber |
WOS:000223839000003 | |
dc.language.iso |
en_US | en_US |
dc.subject |
hypercube | en_US |
dc.subject |
Hamiltonian | en_US |
dc.subject |
Hamiltonian laceable | en_US |
dc.subject |
connectivity | en_US |
dc.subject |
fault tolerance | en_US |
dc.title |
The super laceability of the hypercubes | en_US |
dc.type |
Article | en_US |
檔案
- 000223839000003.pdf (366.6 KB, Adobe PDF)
所屬典藏: 期刊論文