Closure of K-1

Let G and H he graphs. A substitution of H in G for a vertex v is an element of V(G) is the graph G(v -> H), which consists of a disjoint union of H and G - v with the additional edge-set {xy : x is an element of V(H),y is an element of N-G(v)}. For a hered itary class of graphs P, the substitutional closure of P is defined as the class P* consisting of all graphs which can he obtained from graphs in P by repeated substitutions. Let 2K(2) he the graph consisting of two disjoint copies of the complete graphs K-2. The graph K-1 + 2K(2) is obtained from 2K(2) by adding a dominating vertex. We characterize K-1 + 2K(2)-free graphs in terms of forbidden induced subgraphs.