Let G be a noncomplete graph of order n and connectivity k such that deg v> (n +kt - t)/(t+1) for some integer t > 2. Show that if S is a vertex-cut of cardinality (G), then G-S has at most t components.