![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/2/2f/Petersen_graph_complement.svg/640px-Petersen_graph_complement.svg.png&w=640&q=50)
Complement graph
Graph with same nodes but opposite connections as another / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Complement graph?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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 of H are adjacent 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.[1]
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/2/2f/Petersen_graph_complement.svg/320px-Petersen_graph_complement.svg.png)
The complement is not the set complement of the graph; only the edges are complemented.