Graph with same nodes but exactly those edges which are missing in the original graph
Also known as graph complement · complementary graph · inverse graph
10 statements · 20% with external sources · numbers in brackets are citations
4 identifiers linking complement graph across the web's reference databases
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
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.