complement graph | edge-complement | edge-complement graph

The complement of a graph G, sometimes called the edge-complement, is the graph G', sometimes denoted G^_ or G^c (e.g., Clark and Entringer 1983), 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). The graph sum G + G' on a n-node graph G is therefore the complete graph K_n, as illustrated above. A graph complement can be computed in the Wolfram Language by the command GraphComplement[g].

complement | complete graph | cycle complement graph | graph sum | path complement graph | rook complement graph | self-complementary graph | wheel complement graph