孤立韧度与分数（g，f，n′）-临界消去图

摘要

Determine the isolated toughness bound for fractional (g,f,n′)-critical deleted graph in terms of the necessary and sufficient conditions of fractional (g,f,n′)-critical deleted graph and the technology of minimal counterexample construction.It is presented that a graph is fractional (g,f,n′)-critical deleted ifδ(G)≥ bn′a +(b+1 )24a +b and I(G)> b2 +bn′-1a ,if b>a,b+n′, if a={ b.%利用分数（g，f，n′）-临界消去图的充要条件，借助最小反例构造的技巧，给出分数（g，f，n′）-临界消去图的孤立韧度条件．指出在δ（G）≥bn′a ＋（b ＋1）24a ＋b 且I（G）＞ b2＋bn′-1a ，若b ＞a，b ＋n′，若{ a ＝b．的条件下，G是分数（g，f，n′）-临界消去图．