On Isolated Toughness and-Critical Graphs
Shuli Liu · Journal of Weifang University · 2010
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.