tKp-saturated graphs of minimum size

A graph G is H -saturated if G does not contain H as a subgraph but for any nonadjacent vertices u and v , G + u v contains H as a subgraph. The parameter s a t ( H , n ) is the minimum number of edges in an H -saturated graph of order n . In this paper, we determine s a t ( H , n ) for sufficiently large n when H is a unio‎n of cliques of the same order, an arbitrary unio‎n of two cliques and a generalized friendship graph.