Jump to content

Transpose graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Karelj (talk | contribs) at 20:30, 10 January 2007 (interwiki). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A transpose graph is a graph with all of the edges reversed. It is named because its adjacency matrix is the transpose of the adjacency matrix of the original graph.

Stub icon

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Transpose_graph&oldid=99833483"