摘要
本文我们证明如下结果:设G=(V,E)是一个n(n≥3)阶k-连通(k≥2)图,记X1,X2,…,Xk为V的子集,X=X1∪X2∪…∪Xk.若对每个i,i=1,2,…,k,满足:对任意的u,v∈Xi,有d(u)+d(v)≥n或|N(u)∪N(v)|≥n-δ或|N(u)∩N(v)|≥α,这里δ是G的最小度,α是G的独立数,则G是X-可圈的.
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 ∈ X,. we have d(u) + d(v) ≥ n, or [ N(u) U N(v) ≥ n-δ or N(u) ∩ N(v) , whereδis minimum degree of Ganda is independent number of G, thenGis X- cy- clable.
出处
《应用数学》
CSCD
北大核心
2008年第1期162-166,共5页
Mathematica Applicata
基金
the National Natural Science Foundation of China(10501021)
the Natural Science Foundation of the Depart ment of Education of Anhui(KJ2007B322ZC)
关键词
图
圈
哈密尔顿图
可圈性
Graphs
Cycle
Hamiltonian graphs
Cyclability