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, motivated by a recent result of Fujisawa, we prove that a \(2\)-connected weighted graph \(G\) contains either a Hamilton cycle or a cycle of weight at least \(2m/3\) if it satisfies the following conditions:
\((1)\) The weighted degree sum of every three 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 extends a theorem of Zhang, Broersma and Li.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.