{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0RNMP6VCR2"
    }
  ],
  "body": "\n## Summary\n\nThe complement of a graph has the same vertices and exactly the edges that the graph does not have. It swaps cliques and independent sets. The node [[complement graph|0RNMP6VCR2]] gives the precise definition.\n",
  "commit": "545acf83a9b75c8ddc375ef8b23d2ae101a4d7e4",
  "front": {
    "kind": "concept",
    "msc": [
      "05C76"
    ],
    "name": "Complement graph",
    "same_as": {
      "wikidata": "Q902252",
      "wikipedia": "Complement graph"
    },
    "sources": [
      {
        "locator": "Definitions",
        "url": "https://en.wikipedia.org/wiki/Complement_graph"
      }
    ],
    "tag": "0MCYJ72VGA"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0MCYJ72VGA/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0MCYJ72VGA.md",
  "msc": [
    "05C76"
  ],
  "name": "Complement graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0MC/0MCYJ72VGA.md",
  "status": null,
  "tag": "0MCYJ72VGA",
  "uri": "m2://0MCYJ72VGA",
  "url": "https://math2.tamnd.com/wiki/complement-graph/",
  "writing": {
    "tag": "0MCYJ72VGA",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "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
      }
    ]
  }
}