Covering of Vertices of A Simple Graph With Given Connectivity and stability Number

We prove the following lemma. Let G be a k -connected simple graph, k ≥ 2, with stability number α = k + 1. Let C be the longest cycle in G , then G/C is a complete subgraph.