摘要
设G是一个图,若对于图G的任一条边e,G-e都存在一个分数k-因子,则称G是一个分数k-消去图.若k=2,则称分数k-消去图为分数2-消去图.本文证明了当bind(G)≥2,并且δ(G)≥3时,G是分数2-消去图.
A graph G is fractional k-deleted if there exists a fractional k-factor for any edge of G. If k = 2, then a fractional k-deleted graph is called a fractional 2-deleted graph. It is proved that G is fractional 2-deleted if δ(G) ≥ 3 and bind(G)≥2.
出处
《纯粹数学与应用数学》
CSCD
北大核心
2008年第3期551-554,共4页
Pure and Applied Mathematics
基金
江苏省高校自然科学基础研究项目(07KJD110048)
关键词
图
联结数
分数κ-因子
分数κ-消去图
graph, binding number, fractional k-factor, fractional k-deleted graph