科研之友
微信
新浪微博
Facebook
分享链接
摘要
In 2003, Li introduced a concept called implicit weighted degree, denoted by id(w)(v) for a vertex v in a weighted graph. In this paper, we prove that: Let G be a 2-connected weighted graph which satisfies the following conditions: (a) The implicit weighted degree sum of any three independent vertices is at least 7n; (b) For each induced claw, each induced modified claw and each induced P-4 of C, all of its edges have the same weight. Then G contains either a hamiltonian cycle or a cycle of weight at least 2m/3.
- 出版日期2014-7
- 单位曲阜师范大学
