Cycle embedding in faulty wrapped butterfly graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
96 | en_US |
dc.citation.issue |
2 | en_US |
dc.citation.spage |
85 | en_US |
dc.citation.volume |
42 | en_US |
dc.citation.woscount |
2 | |
dc.contributor.author |
Tsai, CH | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:40:26Z | |
dc.date.available |
2014-12-08T15:40:26Z | |
dc.date.issued |
2003-09-01 | en_US |
dc.description.abstract |
In this paper, we study the maximal length of cycle embedding in a faulty wrapped butterfly graph BFn with at most two faults in vertices and/or edges. When there is one vertex fault and one edge fault, we prove that the maximum cycle length is n2(n) - 2 if n is even and n2(n) - 1 if n is odd. When there are two faulty vertices, the maximum cycle length is n2(n) - 2 for odd n. All these results are optimal because the wrapped butterfly graph is bipartite if and only if n is even. (C) 2003 Wiley Periodicals, Inc. | en_US |
dc.identifier.doi |
10.1002/net.10083 | en_US |
dc.identifier.issn |
0028-3045 | en_US |
dc.identifier.journal |
NETWORKS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1002/net.10083 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/27603 | |
dc.identifier.wosnumber |
WOS:000184921100002 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Hamiltonian cycle | en_US |
dc.subject |
wrapped butterfly | en_US |
dc.subject |
fault-tolerant | en_US |
dc.subject |
cycle embedding | en_US |
dc.subject |
Cayley graph | en_US |
dc.title |
Cycle embedding in faulty wrapped butterfly graphs | en_US |
dc.type |
Article | en_US |
檔案
- 000184921100002.pdf (251.9 KB, Adobe PDF)
所屬典藏: 期刊論文