Mutually independent hamiltonian cycles of binary wrapped butterfly graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1825 | en_US |
dc.citation.issue |
11-12 | en_US |
dc.citation.spage |
1814 | en_US |
dc.citation.volume |
48 | en_US |
dc.citation.woscount |
5 | |
dc.contributor.author |
Kueng, Tz-Liang | en_US |
dc.contributor.author |
Liang, Tyne | 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:10:33Z | |
dc.date.available |
2014-12-08T15:10:33Z | |
dc.date.issued |
2008-12-01 | en_US |
dc.description.abstract |
Effective utilization of communication resources is crucial for improving performance in multiprocessor/communication systems. In this paper, the mutually independent hamiltonicity is addressed for its effective utilization of resources on the binary wrapped butterfly graph. Let G be a graph with N vertices. A hamiltonian cycle C of G is represented by < u(1),u(2),...,u(N),u(1)> to emphasize the order of vertices on C. Two hamiltonian cycles of G, namely C(1) = < u(1),u(2),...,u(N),u(1)> and C(2) = < v(1),v(2),...,v(N),v(1)>, are said to be independent if u(1) = v(1) and u(i) not equal v(i) for all 2 <= i <= N. A collection of m hamiltonian cycles C(1),...,C(m), starting from the same vertex, are m-mutually independent if any two different hamiltonian cycles are independent. The mutually independent hamiltonicity of a graph G, denoted by IHC(G), is defined to be the maximum integer m such that, for each vertex u of G, there exists a set of m-mutually independent hamiltonian cycles starting from u. Let BF(n) denote the n-dimensional binary wrapped butterfly graph. Then we prove that IHC(BF(n)) = 4 for all n >= 3. (C) 2008 Elsevier Ltd. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.mcm.2008.08.014 | en_US |
dc.identifier.issn |
0895-7177 | en_US |
dc.identifier.journal |
MATHEMATICAL AND COMPUTER MODELLING | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.mcm.2008.08.014 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/8074 | |
dc.identifier.wosnumber |
WOS:000260757700017 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Interconnection network | en_US |
dc.subject |
Graph | en_US |
dc.subject |
Butterfly graph | en_US |
dc.subject |
Hamiltonian cycle | en_US |
dc.title |
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs | en_US |
dc.type |
Article | en_US |
檔案
- 000260757700017.pdf (1.92 MB, Adobe PDF)
所屬典藏: 期刊論文