The Hamiltonian property of the consecutive-3 digraph
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
88 | en_US |
dc.citation.issue |
11 | en_US |
dc.citation.spage |
83 | en_US |
dc.citation.volume |
25 | en_US |
dc.citation.woscount |
4 | |
dc.contributor.author |
Chang, GJ | en_US |
dc.contributor.author |
Hwang, FK | en_US |
dc.contributor.author |
Tong, LD | en_US |
dc.contributor.department |
交大名義發表 | zh_TW |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
National Chiao Tung University | en_US |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:01:44Z | |
dc.date.available |
2014-12-08T15:01:44Z | |
dc.date.issued |
1997-06-01 | en_US |
dc.description.abstract |
A consecutive-d digraph is a digraph G(d, n, q, r) whose n nodes are labeled by the residues module n and a link from node i to node j exists if and only if j = qi + k (mod n) for some Ic with r less than or equal to k less than or equal to r + d - 1. Consecutive-d digraphs are used as models for many computer networks and multiprocessor systems, in which the existence of a Hamiltonian circuit is important. Conditions for a consecutive-d graph to have a Hamiltonian circuit were known except for gcd(la, d) = 1 and d = 3 Or 4. It was conjectured by Du, Hsu, and Hwang that a consecutive-3 digraph is Hamiltonian. This paper produces several infinite classes of consecutive-3 digraphs which are not (respectively, are) Hamiltonian, thus suggesting that the conjecture needs modification. | en_US |
dc.identifier.doi |
10.1016/S0895-7177(97)00086-1 | 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/S0895-7177(97)00086-1 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/514 | |
dc.identifier.wosnumber |
WOS:A1997XL77800008 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Hamiltonian circuit | en_US |
dc.subject |
consecutive-d digraph | en_US |
dc.subject |
network | en_US |
dc.subject |
loop | en_US |
dc.title |
The Hamiltonian property of the consecutive-3 digraph | en_US |
dc.type |
Article | en_US |
檔案
- A1997XL77800008.pdf (496.5 KB, Adobe PDF)
所屬典藏: 期刊論文