An object is moving counter-clockwise along a circle with the centre at the origin. At \(t=0\) the object is at point \(A(0,5)\) and at \(t=2\pi\) it is back to point \(A\) for the first time.

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, ...