On an extremal problem related to a theorem of Whitney (Q869580)

A classical result of Whitney states that \(\kappa(G)\leq\lambda(G)\leq\delta(G)\) for each graph \(G\), where \(\kappa(G)\) denotes the vertex-connectivity, \(\lambda(G)\) the edge-connectivity and \(\delta(G)\) the minimum degree of \(G\). For any three positive integers \(a\leq b\leq c\), the authors determine the least order and the least size among all graphs \(G\) such that \(\kappa(G)=a\), \(\lambda(G)=b\) and \(\delta(G)=c\). In addition, they show that there exist graphs of all orders greater or equal to the least order with these properties.