Lesson plan
Complement graph
(on the left) and its complement graph (on the right) In the mathematical field of graph theory, the complement or inverse of a graph is a graph on the same vertices such that two distinct vertices are adjacent (connected) in if and only if they are not adjacent in . 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. The complement of the graph is not the set complement of the graph: only the edges are complemented.
Article summary
(on the left) and its complement graph (on the right) In the mathematical field of graph theory, the complement or inverse of a graph is a graph on the same vertices such that two distinct vertices are adjacent (connected) in if and only if they are not adjacent in . 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. The complement of the graph is not the set complement of the graph: only the edges are complemented.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.