Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1305
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorChen, B-
dc.creatorZhang, S-
dc.creatorCheng, TCE-
dc.date.accessioned2014-12-11T08:24:17Z-
dc.date.available2014-12-11T08:24:17Z-
dc.identifier.issn0012-365X-
dc.identifier.urihttp://hdl.handle.net/10397/1305-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsDiscrete Mathematics © 2007 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectHeavy cycleen_US
dc.subjectWeighted degree (sum)en_US
dc.subjectInduced claw (modified claw)en_US
dc.titleHeavy cycles in k-connected weighted graphs with large weighted degree sumsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage4531-
dc.identifier.epage4543-
dc.identifier.volume308-
dc.identifier.issue20-
dc.identifier.doi10.1016/j.disc.2007.08.060-
dcterms.abstractA weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edges. The weighted degree of a vertex is the sum of the weights of the edges incident with it. In this paper, we prove that: Let G be a k-connected weighted graph with k≥2. Then G contains either a Hamilton cycle or a cycle of weight at least 2m/(k+1), if G satisfies the following conditions: (1) The weighted degree sum of any k+1 pairwise nonadjacent vertices is at least m; (2) In each induced claw and each induced modified claw of G, all edges have the same weight. This generalizes an early result of Enomoto et al. on the existence of heavy cycles in k-connected weighted graphs.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationDiscrete mathematics, 28 Oct. 2008, v. 308, no. 20, p. 4531-4543-
dcterms.isPartOfDiscrete mathematics-
dcterms.issued2008-10-28-
dc.identifier.isiWOS:000259074600001-
dc.identifier.scopus2-s2.0-48449084738-
dc.identifier.eissn1872-681X-
dc.identifier.rosgroupidr42353-
dc.description.ros2008-2009 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Heavy cycles in k-connected weighted graphs with large weighted degree sums.pdfPre-published version206.8 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

184
Last Week
0
Last month
Citations as of Mar 24, 2024

Downloads

159
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.