{
  "aliases": [
    "converse-digraph",
    "converse-graph",
    "reverse-digraph",
    "reverse-graph"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn the mathematical and algorithmic study of graph theory, the **converse**, **transpose** or **reverse** of a [[directed graph|0KFYGSHHF5]] $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.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "converse-digraph",
      "converse-graph",
      "reverse-digraph",
      "reverse-graph"
    ],
    "inventory": [
      "JKXNGRGJ52"
    ],
    "kind": "concept",
    "name": "Transpose graph",
    "same_as": {
      "wikidata": "Q3491411",
      "wikipedia": "Transpose graph"
    },
    "sources": [
      {
        "locator": "Transpose graph",
        "mention": "wikipedia://en/5966396",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:5966396@r1116542750"
      }
    ],
    "tag": "N1BGGNV988"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/N1BGGNV988/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/N1BGGNV988.md",
  "msc": null,
  "name": "Transpose graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/N1B/N1BGGNV988.md",
  "status": null,
  "tag": "N1BGGNV988",
  "uri": "m2://N1BGGNV988",
  "url": "https://math2.tamnd.com/wiki/transpose-graph/",
  "writing": {
    "tag": "N1BGGNV988",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}