Transpose graph

In the mathematical and algorithmic study of graph theory, the converse,^[1] transpose^[2] or reverse^[3] 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 converse/transpose/reverse of $G$ contains an edge $(v, u)$ and vice versa.

^ Harary, Frank; Norman, Robert Z.; Cartwright, Dorwin (1965), Structural Models: An Introduction to the Theory of Directed Graphs, New York: Wiley
^ 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", Reviews of Modern Physics, 42 (2): 275, Bibcode:1970RvMP...42..271E, doi:10.1103/RevModPhys.42.271, entry 2.24

[1] Harary, Frank; Norman, Robert Z.; Cartwright, Dorwin (1965), Structural Models: An Introduction to the Theory of Directed Graphs, New York: Wiley

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

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

[1]

[2]

[3]