Graph toughness
= Graph toughness
{wiki=Graph_toughness}
Graph toughness is a concept in graph theory that measures the "resilience" or connectivity of a graph in relation to its vertex cuts. More specifically, the toughness \\( t(G) \\) of a graph \\( G \\) is defined as the minimum ratio of the number of vertices in a connected component to the number of vertices removed to create that component, over all possible ways to disconnect the graph.