Integrity
Материал из WEGA
Integrity --- целостность (графа).
The integrity [math]\displaystyle{ i(G) }[/math] of [math]\displaystyle{ G }[/math] is defined as
[math]\displaystyle{ i(G) = \min\{|X| + m(G - X): \; X \subset V\}, }[/math]
where [math]\displaystyle{ m(G - X) }[/math] stands for the maximum number of vertices among all components of the graph [math]\displaystyle{ G - X }[/math].
The integrity parameter was proposed by Barefoot et al. (1987) as a vulnerability measure of a graph.
See also
- Toughness of a graph.
