首页 | 本学科首页   官方微博 | 高级检索  
     

长圈的邻域交条件的推广
引用本文:余桂东,叶淼林. 长圈的邻域交条件的推广[J]. 大学数学, 2007, 23(3): 70-72
作者姓名:余桂东  叶淼林
作者单位:安庆师范学院,数学系,安徽,安庆,246011;安庆师范学院,数学系,安徽,安庆,246011
摘    要:证明了若G为一个k(k≥2)连通简单图,独立数为α,V(G)=n≥3,X1,X2,…,Xk是顶点集合V的子集,X=X1∪X2∪…∪Xk,且对于Xi(i=1,2,…,k)中任意两个不相邻点u,v,|N(u)∩N(v)|≥α,则X在G中可圈,并给出几个相关推论.

关 键 词:邻域    Hamilton图  可圈
文章编号:1672-1454(2007)03-0070-03
修稿时间:2005-11-02

A Generalization of a Neighborhood Intersection Condition for Long Cycles
YU Gui-dong,YE Miao-lin. A Generalization of a Neighborhood Intersection Condition for Long Cycles[J]. College Mathematics, 2007, 23(3): 70-72
Authors:YU Gui-dong  YE Miao-lin
Abstract:This paper has proved that if a simple graph G of order n(≥3) is k-connected(k≥2) and such that for each i,i=1,2,…,k,and for each pair of nonadjacent vertices u,v∈Xi,where X1,X2,…,Xk are subsets of the vertex set V and X=X1∪X2∪…∪Xk,we have |N(u)∩N(v)|≥α,where α is independent number of G,then G is X-cyclable.Moreover,it gives some propositions.
Keywords:neighborhood  cycles  Hamiltonian graphs  cyclability
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号