A note on the saturation number of the family of -connected graphs

Given a family of graphs F , a graph G is F -saturated if no member of F is a subgraph of G , but for all e ∈ E ( G ¯ ) , some member of F is a subgraph of G + e . The saturation number of F , denoted by sat ( n , F ) , is the minimum number of edges in an n -vertex F -saturated graph. In this note we determine the saturation number for the family of k -connected graphs.