Inverse graph

In graph theory, the inverse graph of a graph, G, is the graph with the exact same vertices as G, but the [[edge|edges] are inversed, i.e., where there was a edge, there isn't, and there there wasn't an edge, there now is.