{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nA canonical form of a graph is an invariant such that two graphs have equal invariants if and only if they are isomorphic. Canonical forms may also be called canonical invariants or complete invariants, and are sometimes defined only for the graphs within a particular family of graphs. Graph canonization is the process of computing a canonical form.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "FYV7609WFE"
    ],
    "kind": "concept",
    "name": "Canonization",
    "sources": [
      {
        "locator": "Glossary of graph theory, section C",
        "mention": "wikipedia://en/325802#Y3D4",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:325802@r1373839425"
      }
    ],
    "tag": "9WQQXPN0N5"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/9WQQXPN0N5/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/9WQQXPN0N5.md",
  "msc": null,
  "name": "Canonization",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/9WQ/9WQQXPN0N5.md",
  "status": null,
  "tag": "9WQQXPN0N5",
  "uri": "m2://9WQQXPN0N5",
  "url": "https://math2.tamnd.com/wiki/canonization/",
  "writing": {
    "tag": "9WQQXPN0N5",
    "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
      }
    ]
  }
}