Let G = (V,E) be an undirected, unweighted graph with n = |V| vertices.
Let G = (V,E) be an undirected, unweighted graph with n = |V| vertices. The distance between two vertices u,v ∈ G is the length of the shortest path between them. A vertex cut of G is a subset S ⊆ V such that removing the vertices in S (as well as incident edges) disconnects […]