Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

This is a preview. Log in through your library . Abstract We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process ...