Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Strength of a graph
open-in-new
<p>In <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>, the strength of an undirected <a href="/facts/Graph_(discrete_mathematics)/kw3eIBUe">graph</a> corresponds to the minimum ratio of <i>edges removed</i>/<i>components created</i> in a decomposition of the graph in question. It is a method to compute <a href="/facts/Partition_of_a_set/VeP9g8CA">partitions</a> of the set of vertices and detect zones of high concentration of edges, and is analogous to <a href="/facts/Graph_toughness/92anGVk5">graph toughness</a> which is defined similarly for vertex removal. </p>