$\kappa(G)$ is the vertex connectivity of $G$, which is the minimum number of vertices that need to be removed to disconnect the graph.
$\lambda(G)$ is the edge connectivity of $G$, which is the minimum number of edges that need to be removed to disconnect the
Show more…