Whitney’s Theorem κ(G) ≤ λ(G) ≤ δ(G) where: δ(G) - denotes the minimum degree of graph G λ(G) - denotes the edge-connectivity of graph G κ(G) - denotes the node-connectivity of graph G