A proof of an inequality concerning \(k\)-restricted edge connectivity (Q2576846)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A proof of an inequality concerning \(k\)-restricted edge connectivity |
scientific article |
Statements
A proof of an inequality concerning \(k\)-restricted edge connectivity (English)
0 references
29 December 2005
0 references
A \(k\)-restricted edge cut of a graph \(G\) is an edge cut \(S\) so that each component of \(G-S\) has at least \(k~\;\)vertices. The authors show that, except for a small class of graphs, a \(k\)-restricted edge cut of a connected graph \(G\) exists for all \(k\leq \delta (G)+1.\)
0 references
\(k\)-restricted edge cut
0 references
minimum degree
0 references
0 references
0 references
