Mathematical Sciences Letters An International Journal

Content
 Avoiding Certain Graphs for a Variation of Toughness PP: 243-248 Author(s) Abstract For an undirected simple graph $G$, a variation of toughness is defined as $$\tau(G)=\min\{\frac{|S|}{\omega(G-S)-1}\Big{|}\omega(G-S)\ge2 \}$$ if $G$ is not complete, and $\tau(G)=\infty$ if $G$ is complete. In this paper, we determine the connected graph families $\mathcal{F}$ such that every large enough connected $\mathcal{F}$-free graph is $\tau$-tough.