赋权图中重路的隐赋权度条件  

IMPLICIT WEIGHTED DEGREE CONDITION FOR HEAVY PATHS IN WEIGHTED GRAPHS

作　　者：李萍[1] 

机构地区：[1]山东师范大学数学系,济南250014

出　　处：《山东师范大学学报（自然科学版）》2003年第1期11-13,共3页Journal of Shandong Normal University(Natural Science)

摘　　要：对 2 -连通非Hamilton赋权图G ,本文给出了重路存在的隐赋权度条件 :若G满足文中描述的条件C1 、C2 ,且max{idw(u) ,idw(v) |d(u ,v) =2 }≥ m2 ,则当G中存在y -最长路时 ,存在一最重的y-最长路P(x ,y)满足dw(x)≥ m2 .In this paper we give an implicit weighted degree condition for heavy cycles in a 2-connected nonhamiltonian weighted gragh:suppose that G satisfies conditions C 1 and C 2 mentioned in the paper and max{id w(u),id w(v)|d(u,v)=2}≥m2.Then G contains a heaviest y-longest path P(x,y) such that d w(x)≥m2 if there exists a y- longest path in G.

关 键 词：赋权图 重路 隐赋权度 y—最长路 v—最长路 有限简单图 

分 类 号：O157.5[理学—数学]