Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree

The vertex connectivity, k(g), of a graph g is the minimum number of vertices whose removal from g results in either a disconnected or a trivial graph. Edge connectivity, kʹ(g), has an analogous definition with edges replacing vertices in the previous definition. A well known result of H. Whitney provides a comparison between the two connectivities and the minimum vertex degree of a graph.