Edge-integrity
Материал из WikiGrapp
Edge-integrity --- реберная целостность.
The edge-integrity of a graph [math]\displaystyle{ G }[/math] is
[math]\displaystyle{ I'(G) = \min\{|S| + m(G - S): \; S \subset E\}, }[/math]
where [math]\displaystyle{ m(H) }[/math] denotes the maximum order of a component of [math]\displaystyle{ H }[/math].
