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+uv contains H as a subgraph. The parameter sat(H,n) is the minimum number of edges in an H-saturated graph of order n. In this paper, we determine sat(H,n) for sufficiently large n when H is a union of cliques of the same order, an arbitrary union of two cliques and a generalized friendship graph.