Complement graph: Difference between revisions

Revision as of 09:24, 26 June 2016

Revision as of 09:26, 26 June 2016

Line 1:

https://fa.wikipedia.org/wiki/%DA%AF%D8%B1%D8%A7%D9%81_%D9%85%DA%A9%D9%85%D9%84[[File:Petersen graph complement.svg|thumb|upright=1.35|The [[Petersen graph]] (on the left) and its complement graph (on the right).]]

In [[graph theory]], the '''complement''' or '''inverse''' of a graph {{mvar|G}} is a graph {{mvar|H}} on the same vertices such that two distinct vertices of {{mvar|H}} are adjacent [[if and only if]] they are not adjacent in {{mvar|G}}. 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.<ref name="bm">{{citation

| last1=Bondy | first1=John Adrian | authorlink1=John Adrian Bondy