tKptKp-saturated graphs of minimum size

A graph GG is HH-saturated   if GG does not contain HH as a subgraph but for any nonadjacent vertices uu and vv, G+uvG+uv contains HH as a subgraph. The parameter sat(H,n)sat(H,n) is the minimum number of edges in an HH-saturated graph of order nn. In this paper, we determine sat(H,n)sat(H,n) for sufficiently large nn when HH is a union of cliques of the same order, an arbitrary union of two cliques and a generalized friendship graph.