Optimal 1-Hamiltonian graphs
| dc.citation.epage | 161 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 157 | en_US |
| dc.citation.volume | 65 | en_US |
| dc.citation.woscount | 10 | |
| dc.contributor.author | Wang, JJ | en_US |
| dc.contributor.author | Hung, CN | 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:49:20Z | |
| dc.date.available | 2014-12-08T15:49:20Z | |
| dc.date.issued | 1998-02-13 | en_US |
| dc.description.abstract | In this paper, we present a family of 3-regular, planar, and hamiltonian graphs. Any graph in this family remains hamiltonian if any node or any edge is deleted. Moreover, the diameter of any graph in this family is O(root p) where p is the number of nodes. (C) 1998 Elsevier Science B.V. | en_US |
| dc.identifier.issn | 0020-0190 | en_US |
| dc.identifier.journal | INFORMATION PROCESSING LETTERS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/32792 | |
| dc.identifier.wosnumber | WOS:000072792000009 | |
| dc.language.iso | en_US | en_US |
| dc.subject | hamiltonian cycle | en_US |
| dc.subject | token ring | en_US |
| dc.subject | fault tolerance | en_US |
| dc.title | Optimal 1-Hamiltonian graphs | en_US |
| dc.type | Article | en_US |