Jump to content

Complement graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Marianocecowski (talk | contribs) at 13:32, 16 November 2004 (graph complement). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In graph theory the complement of a graph G is so that two vertices are adjacent in it if and only if the where not adjacent in the original graph G.