Content deleted Content added
m moved Strength of a graph (graph theory) to Strength of a graph: Remove redundant disambiguator |
m Fix links to disambiguation page Partition |
||
Line 5:
}}
In the branch of [[mathematics]] called [[graph theory]], the '''strength''' of an undirected [[graph (mathematics)|graph]] corresponds to the minimum ratio ''edges removed''/''components created'' in a decomposition of the graph in question. It is a method to compute [[Partition of a set|partitions]] of the set of vertices and detect zones of high concentration of edges.
== Definitions ==
| |||