Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ho, Tung-Yang | en_US |
dc.contributor.author | Lin, Cheng-Kuan | en_US |
dc.contributor.author | Tan, Jimmy J. M. | en_US |
dc.contributor.author | Hsu, D. Frank | en_US |
dc.contributor.author | Hsu, Lih-Hsing | en_US |
dc.date.accessioned | 2014-12-08T15:27:06Z | - |
dc.date.available | 2014-12-08T15:27:06Z | - |
dc.date.issued | 2011-09-01 | en_US |
dc.identifier.issn | 1016-2364 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/19337 | - |
dc.description.abstract | Assume that n and delta are positive integers with 2 <= delta < n. Let h(n, delta) be the minimum number of edges required to guarantee an n-vertex graph with minimum degree delta(G) >= delta be hamiltonian, i.e., any n-vertex graph G with delta(G) >= delta is hamiltonian if vertical bar E(G)vertical bar >= h(n, delta). We move that h(n, delta) = (n - delta, 2) + delta(2) +1 if delta <= left perpendicular n + 1 + x ((n + 1mld 2)/6 right perpendicular, h(n, delta) = C(n - left perpendicular n - 1/2 right perpendicular, 2) + left perpendicular n - 1/2 right perpendicular(2) + 1 if left perpendicular n + 1 + 3 x ((n + 1) mod2)/6 < delta <= left perpendicular n - 1/2 right perpendicular, and h(n, delta, = inverted right perpendicular n delta/2inverted left perpendicular if delta > left perpendicular n - 1/2 right perpendicular. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | complete graph | en_US |
dc.subject | cycle | en_US |
dc.subject | hamiltonian | en_US |
dc.subject | hamiltonian cycle | en_US |
dc.subject | edge-fault tolerant hamiltonian | en_US |
dc.title | On the Extremal Number of Edges in Hamiltonian Graphs | en_US |
dc.type | Article | en_US |
dc.identifier.journal | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
dc.citation.volume | 27 | en_US |
dc.citation.issue | 5 | en_US |
dc.citation.spage | 1659 | en_US |
dc.citation.epage | 1665 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000295605300009 | - |
dc.citation.woscount | 0 | - |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.