摘要
令G是一个连通的n阶范型图。证明了若n≥4,则G有分数1-因子。若δ(G)≥k且n≥8k2+12k+6,则G有分数k-因子。
Let G be a connected graph of order n and of Fan type. In this paper it is proved that if n ≥ 4 , then G has a fractional 1-factor, and if δ(G) ≥ k and n ≥ 8k2 + 12k + 6, then G has a fractional k-factor.
出处
《工程数学学报》
CSCD
北大核心
2005年第2期377-380,共4页
Chinese Journal of Engineering Mathematics
基金
NSFC(60172003)NSF(Z200A02)of Shandong Province of ChinaResearch Foun-dation of Doctoral Discipline of Higher ducation(20040422004)DRF of QUNU
关键词
图
因子
分数1-因子
分数κ-因子
graph
factor
fractional 1-factor
fractional k-factor
