Abstract
A graph is called a weighted graph when each edge e is assigned a nonnegative number w(e), called the weight of e. For a vertex v of a weighted graph, dw(v) is the sum of the weights of the edges incident with v. For a subgraph H of a weighted graph G, the weight of H is the sum of the weights of the edges belonging to H. In this paper, we give a new sufficient condition for a weighted graph to have a heavy cycle. A 2-connected weighted graph G contains either a Hamilton cycle or a cycle of weight at least c, if G satisfies the following conditions: In every induced claw or induced modified claw F of G, (1) max{dw(x),dw(y)}≥ c/2 for each non-adjacent pair of vertices x and y in F, and (2) all edges of F have the same weight.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fujisawa, J. Claw Conditions for Heavy Cycles in Weighted Graphs. Graphs and Combinatorics 21, 217–229 (2005). https://doi.org/10.1007/s00373-005-0607-2
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-005-0607-2