 Whitney inequalities for graph connectivity

For every nontrivial graph, $\kappa (G)\le \lambda (G)\le \delta (G)$.

These compare two numerical invariants of connectivity with the minimum degree of a graph.