{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, an **independent dominating set** for a [[graph|00C0BR7D7H]] $G = (V, E)$ is a [[subset|0BJR9QR08E]] $D \\subseteq V$ that is both a dominating set and an [[independent set|08ANQHHG3P]]; equivalently, it is a maximal independent set.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "8TYMVM20HK"
    ],
    "kind": "concept",
    "name": "Independent dominating set",
    "same_as": {
      "wikidata": "Q138529530",
      "wikipedia": "Independent dominating set"
    },
    "sources": [
      {
        "locator": "Independent dominating set",
        "mention": "wikipedia://en/82242215",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:82242215@r1335401508"
      }
    ],
    "tag": "78K8EM64D1"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/78K8EM64D1/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/78K8EM64D1.md",
  "msc": null,
  "name": "Independent dominating set",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/78K/78K8EM64D1.md",
  "status": null,
  "tag": "78K8EM64D1",
  "uri": "m2://78K8EM64D1",
  "url": "https://math2.tamnd.com/wiki/independent-dominating-set/",
  "writing": {
    "tag": "78K8EM64D1",
    "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
      }
    ]
  }
}