Graph toughness
From Wikipedia, the free encyclopedia
Let ω(G) denote the number of components of a graph G. A graph G is t-tough if |S| ≥ tω(G − S) for every subset S of the vertex set V (G) with ω(G − S) > 1 (According to Toughness in Graphs, Bauer, Broersma & Schmeichel).
In a t-tough graph, any t nodes can be removed without splitting the graph in two.