High Quality Content by WIKIPEDIA articles! In the branch of mathematics called graph theory, the strength of an undirected graph corresponds to the minimum ratio edges removed/components created in a decomposition of the graph in question. It is a method to compute partitions of the set of vertices and detect zones of high concentration of edges. The strength ?(G) of an undirected simple graph G = (V, E) admits the three following definitions: * Let ? be the set of all partitions of V, and partial pi be the set of edges crossing over the sets of the partition piinPi, then displaystylesigma(G)=min_{piinPi}frac{|partial pi|}{|pi|-1}.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.