{
  "aliases": [
    "dominating-set-problem",
    "domination-number",
    "domination-perfect-graph",
    "independence-domination-number",
    "independent-domination-number",
    "minimum-dominating-set",
    "total-dominating-set",
    "total-domination-number"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **dominating set** for a [[graph|00C0BR7D7H]] $G$ is a subset $D$ of its vertices, such that any vertex of $G$ is in $D$, or has a neighbor in $D$. The **domination number** $\\gamma(G)$ is the number of vertices in a smallest dominating set for $G$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "dominating-set-problem",
      "domination-number",
      "domination-perfect-graph",
      "independence-domination-number",
      "independent-domination-number",
      "minimum-dominating-set",
      "total-dominating-set",
      "total-domination-number"
    ],
    "inventory": [
      "JGQT0A10DW"
    ],
    "kind": "concept",
    "name": "Dominating set",
    "same_as": {
      "wikidata": "Q2915204",
      "wikipedia": "Dominating set"
    },
    "sources": [
      {
        "locator": "Dominating set",
        "mention": "wikipedia://en/1747972",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:1747972@r1374757470"
      }
    ],
    "tag": "3CZGXK7EWW"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/3CZGXK7EWW/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/3CZGXK7EWW.md",
  "msc": null,
  "name": "Dominating set",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/3CZ/3CZGXK7EWW.md",
  "status": null,
  "tag": "3CZGXK7EWW",
  "uri": "m2://3CZGXK7EWW",
  "url": "https://math2.tamnd.com/wiki/dominating-set/",
  "writing": {
    "tag": "3CZGXK7EWW",
    "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
      }
    ]
  }
}