gives the graph complement of the graph g.


uses rules vw to specify the graph g.

Details and Options

  • The graph complement has the same vertices and edges defined by two vertices being adjacent only if they are not adjacent in g.
  • GraphComplement works with undirected graphs, directed graphs, multigraphs, and mixed graphs.


open allclose all

Basic Examples  (2)

Graph complement of cycle graphs:

Graph complement of directed graphs:

Scope  (6)

GraphComplement works with undirected graphs:

Directed graphs:

Multiple graphs:

Mixed graphs:

Use rules to specify the graph:

GraphComplement works with large graphs:

Properties & Relations  (7)

The complement of a CompleteGraph is an edgeless graph:

The complement of the complement is the original graph (for simple graphs):

The complement of the graph can be obtained from its adjacency matrix:

An independent vertex set of the graph is a clique of its complement graph:

The complement of the line graph of is a Petersen graph:

The graph union of any simple graph and its complement is a complete graph:

The graph intersection of any graph and its complement is an empty graph:

Introduced in 2010
Updated in 2014