Complement graphComplement graph
Uncommon
Rarity: Uncommon
A topic a little better known than average, read and translated beyond its own country.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
In the mathematical field of graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two distinct vertices are adjacent (connected) in H if and only if they are not adjacent in 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.
Excerpt from the Wikipedia article “Complement graph”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: Complement_graph_sample.gif: Claudio Rocchini derivative work: David Eppstein, CC BY 2.5, via Wikimedia Commons.
Open free boosters and add Complement graph to your collection.
Play for free




