Jump to content

Inverse graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Oleg Alexandrov (talk | contribs) at 17:23, 23 March 2005 ("Made {{stub}} into {{math-stub}}. This is an automatic update."). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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