应用数学2008，Vol.21Issue(1)：162-166,5.
可圈的一个充分条件
A Sufficient Condition of Cyclability
摘要
Abstract
We prove the following result:let G=(V,E) be a k-connected graph,k≥2,of order n≥3.Denote by X1,X2,...,Xk subsets of vertex set V and let X=X1∪X2∪…∪Xk.If for each i,i=1,2,...,k, and each pair of nonadjacent vertices u,v∈Xi,we have d(u)+d(v)≥n, or |N(u)∪N(v)|≥n-δ or |N(u)∩N(v)|≥α,where δ is minimum degree of G and α is independent number of G,then G is X-cyclable.关键词
图/圈/哈密尔顿图/可圈性Key words
Graphs/Cycle/Hamiltonian graphs/Cyclability分类
数理科学引用本文复制引用
余桂东,叶淼林..可圈的一个充分条件[J].应用数学,2008,21(1):162-166,5.基金项目
Supported by the National Natural Science Foundation of China(10501021),the Natural Science Foundation of the Department of Education of Anhui (KJ2007B322ZC) （10501021）
