泛连通图和邻域并条件  

Pathconnected Graphs with Neighborhood Union Conditions

作　　者：赵克文[1] 曾克扬[1] 

机构地区：[1]琼州大学数学系

出　　处：《吉林大学学报（理学版）》2003年第2期162-165,共4页Journal of Jilin University:Science Edition

摘　　要：刻划2连通图在条件NC≥n-δ+1下的Pnm泛连通图性.得到结果:2连通n阶图G,若NC≥n-δ+1,则G是Pn6泛连通图或G2:(Ks+Kh).Let Pnmpathconnected denote the graph of each pair of vertices that has paths each order from m to n, the following result is obtained: for a 2connected graph of order n(n≥6), if NC≥n-δ+1, then G is Pn6pathconnected graphs or G=G2: (Ks+Kh), the result has also improved some results by Faudree et al and Wei Bing, Zhu Yongjun.

关 键 词：泛连通图 邻域并 哈密尔顿图 点泛圈图 路 有限图 最小度 

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