Revision as of 19:36, 18 December 2013 edit 216.31.219.19 (talk) Adding distinct-vertices clarification which is also echoed in the following statement which refers to a complete graph. ← Previous edit		Revision as of 19:49, 18 December 2013 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,811 edits simplify wording Next edit →
Line 1: [[File:Petersen graph complement.svg\|thumb\|300px\|The [[Petersen graph]] (on the left) and its complement graph (on the right).]] In [[graph theory]], the '''complement''' or '''inverse''' of a graph ''G'' is a graph ''H'' on the same vertices such that two distinct vertices of ''H'' are adjacent [[if and only if]] they are not adjacent in ''G''~~, and if they are distinct vertices~~. That is, to generate the complement of a graph, one fills in all the missing edges required to form a [[complete graph]], and removes all the edges that were previously there. It is not, however, the [[complement (set theory)\|set complement]] of the graph; only the edges are complemented. ==Formal construction==

Complement graph: Difference between revisions