Transpose graph
Summary
In the mathematical and algorithmic study of graph theory, the converse, transpose or reverse of a directed graph 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 . That is, if contains an edge then the converse/transpose/reverse of contains an edge and vice versa.
Further reading
- Wikipedia, page 5966396, revision 1116542750, Transpose graph. adopted
About this page
| Tag | N1BGGNV988 |
|---|---|
| URI | m2://N1BGGNV988 |
| Aliases | converse-digraph, converse-graph, reverse-digraph, reverse-graph |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.