Back Komplement grafu Czech Komplementgraph German Grafo complemento Spanish Graafi täiend Estonian گراف مکمل Persian Graphe complémentaire French גרף משלים HE Komplementer gráf Hungarian Grafo complemento Italian 補グラフ Japanese
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]
The complement is not the set complement of the graph; only the edges are complemented.
- ^ Bondy, John Adrian; Murty, U. S. R. (1976), Graph Theory with Applications, North-Holland, p. 6, ISBN 0-444-19451-7.