Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1229
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Cheng, TCE | - |
dc.creator | Chen, Y | - |
dc.creator | Ng, CTD | - |
dc.date.accessioned | 2014-12-11T08:27:32Z | - |
dc.date.available | 2014-12-11T08:27:32Z | - |
dc.identifier.issn | 0012-365X | - |
dc.identifier.uri | http://hdl.handle.net/10397/1229 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Discrete Mathematics © 2007 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Domination-critical graph | en_US |
dc.subject | Hamilton-connectivity | en_US |
dc.title | Codiameters of 3-domination critical graphs with toughness more than one | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Author name used in this publication: C. T. Ng | en_US |
dc.identifier.spage | 1067 | - |
dc.identifier.epage | 1078 | - |
dc.identifier.volume | 309 | - |
dc.identifier.issue | 5 | - |
dc.identifier.doi | 10.1016/j.disc.2007.11.061 | - |
dcterms.abstract | A graph G is 3-domination-critical (3-critical, for short), if its domination number γ is 3 and the addition of any edge decreases γ by 1. In this paper, we show that every 3-critical graph with independence number 4 and minimum degree 3 is Hamilton-connected. Combining the result with those in [Y.J. Chen, F. Tian, B. Wei, Hamilton-connectivity of 3-domination critical graphs with α≤δ, Discrete Mathematics 271 (2003) 1–12; Y.J. Chen, F. Tian, Y.Q. Zhang, Hamilton-connectivity of 3-domination critical graphs with α=δ+2, European Journal of Combinatorics 23 (2002) 777–784; Y.J. Chen, T.C.E. Cheng, C.T. Ng, Hamilton-connectivity of 3-domination critical graphs with α=δ+1≥5, Discrete Mathematics 308 (2008) (in press)], we solve the following conjecture: a connected 3-critical graph G is Hamilton-connected if and only if τ(G)>1, where τ(G) is the toughness of G. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Discrete mathematics, Mar. 2009, v. 309, no. 5, p. 1067-1078 | - |
dcterms.isPartOf | Discrete mathematics | - |
dcterms.issued | 2009-03-28 | - |
dc.identifier.isi | WOS:000264934500009 | - |
dc.identifier.scopus | 2-s2.0-60549108603 | - |
dc.identifier.eissn | 1872-681X | - |
dc.identifier.rosgroupid | r42337 | - |
dc.description.ros | 2008-2009 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CCT.pdf | Pre-published version | 189.38 kB | Adobe PDF | View/Open |
Page views
160
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
155
Citations as of Apr 21, 2024
SCOPUSTM
Citations
3
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
2
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.