Definition 11: The complement of a graph g is the graph(denoted G) with the same vertex set but whose edge set consists of the edges not present in G(i.e, the complement of the edge set of G with respect to all possible edges on the vertex set of g) KDefinition 11: The complement of a graph G is the graph (denoted G ) with the same vertex set but whose edge set consists of the edges not present in G (i.e., the complement of the edge set of G with respect to all possible edges on the vertex set of G)