Graph Complement
The complement of a graph ๐ G
, sometimes called the edge-complement (Gross and Yellen 2006,
p. 86), 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.
The adjacency matrix ๐ A^_
of the graph complement of the graph with adjacency
matrix ๐ A
is given by
(Ellis-Monaghan and Merino 2008), where ๐ J
is the unit matrix and ๐ I
is the identity
matrix.
A graph complement can be computed in the Wolfram Language by the command [g].
See also
Complement, Complete Graph, Cycle Complement Graph, Graph Sum, Path Complement Graph, Rook Complement Graph, Self-Complementary Graph, Wheel Complement GraphExplore with Wolfram|Alpha
More things to try:
References
Clark, L. and Entringer, R. "Smallest Maximally Nonhamiltonian Graphs." Periodica Math. Hungarica 14, 57-68, 1983.Ellis-Monaghan, J. A. and Merino, C. "Graph Polynomials and Their Applications II: Interrelations and Interpretations." 28 Jun 2008. http://arxiv.org/abs/0806.4699.Gross, J. T. and Yellen, J. Graph Theory and Its Applications, 2nd ed. Boca Raton, FL: CRC Press, 2006.Skiena, S. "The Complement of a Graph." ยง3.2.3 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, p. 93, 1990.Referenced on Wolfram|Alpha
Graph ComplementCite this as:
Weisstein, Eric W. "Graph Complement." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GraphComplement.html
