与分数k-消去图

and Fractional k-deleted Graphs

摘要: 设G是一个图,若对于图G的任一边e,G-e都存在一个分数k-因子,则称G是一个分数k-消去图.对于非完全图,证明当顶点数、最小度以及满足一定条件时G是分数k-消去图.并说明结论在一定意义上是最好的.

Abstract: A graph G is fractional k-deleted if there exists a fractional k-factor in G-e for any edge e of G. It is proved that G is fractional k-deleted graph under certain conditions. The results are proved to be the best possible in some sense.