Skip to main content
Log in

Claw Conditions for Heavy Cycles in Weighted Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jun Fujisawa.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-005-0607-2

Keywords

Navigation