摘要
对2-连通赋权图G,本文证明了如下新结果:若G满足对任意独立集S={u,v,w},存在x≠y∈S,使得dw(x)+dw(y)≥m,则图G或者包含Hamilton圈或者含权重≥m的圈,它推广了非赋权图及赋权图的相关已有结果。
Proves the following result:suppose G is a 2-connected weighted graph that satisfies for any independent set S={u,v,w},there exists x≠y∈S such that dw(x)+dw(y)≥m,then there exists a Hamilton cycle or a cycle of weight at least m.This generalizes related theroems on the existence of long cycles in unweighted graphs to weighted graphs and the related result in weighted graphs.
出处
《华东船舶工业学院学报》
2003年第3期74-76,共3页
Journal of East China Shipbuilding Institute(Natural Science Edition)
基金
院青年教师基金项目(院编2002501)
