Embedding cycles in IEH graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
27 | en_US |
dc.citation.spage |
23 | en_US |
dc.citation.volume |
64 | en_US |
dc.citation.woscount |
6 | en_US |
dc.contributor.author |
Chang, HY | en_US |
dc.contributor.author |
Chen, RJ | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2019-04-02T05:58:47Z | |
dc.date.available |
2019-04-02T05:58:47Z | |
dc.date.issued |
1997-10-14 | en_US |
dc.description.abstract |
We embed cycles into IEH graphs. First, IEH graphs are proved to be Hamiltonian except when they are of size 2(n) -1 for all n greater than or equal to 2. Next, we show that for an IEH graph of size N, an arbitrary cycle of even length N-e where 3 < N-e < N is found. We also find an arbitrary cycle of odd length N-o where 2 < N-o < N if and only if a node of this graph has at least one forward 2-Inter-Cube (IC) edges. These results help describe the whole cycle structure in IEH graphs. (C) 1997 Elsevier Science B.V. | en_US |
dc.identifier.doi |
10.1016/S0020-0190(97)00147-6 | 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/S0020-0190(97)00147-6 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/149687 | |
dc.identifier.wosnumber |
WOS:A1997YG01100004 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
hypercubes | en_US |
dc.subject |
embedding | en_US |
dc.subject |
Hamiltonian cycles | en_US |
dc.subject |
Incrementally Extensible Hypercubes | en_US |
dc.subject |
interconnection networks | en_US |
dc.title |
Embedding cycles in IEH graphs | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文