Transpose graph

In the mathematical and algorithmic study of graph theory, the transpose graph^[1] or reverse graph^[2] of a directed graph G is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in G. That is, if G contains an edge (u,v) then the transpose of G contains an edge (v,u) and vice versa. The transpose graph is so named because its adjacency matrix is the transpose of the adjacency matrix of the original graph. It is denoted symbolically as G^T or G^R depending on whether the transpose graph or reverse graph terminology is used, respectively.

References

^ Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. Introduction to Algorithms. MIT Press and McGraw-Hill., ex. 22.1–3, p. 530.
^ Essam, John W.; Fisher, Michael E. (1970), "Some basic definitions in graph theory", Review of Modern Physics, 42 (2): 271–288, doi:10.1103/RevModPhys.42.271, entry 2.24, p. 275.

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

[1] Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. Introduction to Algorithms. MIT Press and McGraw-Hill., ex. 22.1–3, p. 530.

[2] Essam, John W.; Fisher, Michael E. (1970), "Some basic definitions in graph theory", Review of Modern Physics, 42 (2): 271–288, doi:10.1103/RevModPhys.42.271, entry 2.24, p. 275.

[1]

[2]