 Complement graph

The complement of a simple graph has exactly the edges absent from the original graph; a vertex of degree $d$ acquires degree $n-1-d$.

In graph theory, the complement of a graph is a graph that contains the same set of vertices but has edges that are not present in the original graph.