Minimum degree and connectivity

$\lambda\le\delta$. Removing all edges incident to a vertex of minimum degree disconnects the graph, so $\lambda\le\delta$.

$\kappa\le\lambda$. Removing $\lambda$ edges disconnecting the graph involves at most $\lambda$ vertices on one side; removing those vertices disconnects.

Conclusion. $\kappa(G)\le\lambda(G)\le\delta(G)$.