Heavy cycles in k-connected weighted graphs with large weighted degree sums

Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1305

Title:	Heavy cycles in k-connected weighted graphs with large weighted degree sums
Authors:	Chen, B Zhang, S Cheng, TCE
Issue Date:	28-Oct-2008
Source:	Discrete mathematics, 28 Oct. 2008, v. 308, no. 20, p. 4531-4543
Abstract:	A 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.
Keywords:	Heavy cycle Weighted degree (sum) Induced claw (modified claw)
Publisher:	Elsevier
Journal:	Discrete mathematics
ISSN:	0012-365X
EISSN:	1872-681X
DOI:	10.1016/j.disc.2007.08.060
Rights:	Discrete Mathematics © 2007 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:	Journal/Magazine Article

File	Description	Size	Format
Heavy cycles in k-connected weighted graphs with large weighted degree sums.pdf	Pre-published version	206.8 kB	Adobe PDF	View/Open

Status	open access
File Version	Final Accepted Manuscript

View full-text via PolyU eLinks

139

Last Week
0

Last month

Citations as of Jun 4, 2023

138

Citations as of Jun 4, 2023

1

Last Week
0

Last month
0

Citations as of Jun 2, 2023

1

Last Week
0

Last month
0

Citations as of Jun 1, 2023

Check