孤立韧度与(1,b,n)-临界图

On Isolated Toughness and-Critical Graphs

设G是一个图且b,n是非负整数,b≥2,如果消去G的n个顶点剩下的图有[1,b]-因子,则称图G是(1,b,n)-临界图。本文出了图是(1,b,n)-临界图的孤立韧度条件。

Let G be agraph and b,n be nonnegative integers with b≥2.A graph G is called （1,b,n）-critical graph if after deleting any n vertics of G the remaining graph of G has a -factor.In this paper an isolated toughness condition for graphs to be （1,b,n）-critical graph is given.