{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "0FQ5B8S1ZC"
    },
    {
      "field": "uses",
      "target": "0J6G5NJC5R"
    },
    {
      "field": "uses",
      "target": "0V05FC4GKQ"
    }
  ],
  "body": "\n## Definition\n\nLet $G = (V, E)$ be a [[graph|0JD5C82QMB]].\nA subgraph of $G$ is a graph $H = (V', E')$ with $V' \\subseteq V$ and $E' \\subseteq E$.\nEach edge of $E'$ has both ends in $V'$, because $H$ is a graph.\n\n## Remarks\n\nA subgraph is spanning if $V' = V$.\nAn [[induced subgraph|0V05FC4GKQ]] keeps all edges of $G$ between the chosen vertices.\nIn the cycle $C_4$ with vertices $1, 2, 3, 4$, the path $1 - 2 - 3$ is a subgraph.\n\n## Explanations\n\n### L1 human\n\nTo get a subgraph, delete some vertices and some edges of a graph.\nWhen you delete a vertex, you must also delete the edges at that vertex.\n",
  "commit": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "defines": "0WBFFC8XZ9",
    "kind": "definition",
    "msc": [
      "05C99"
    ],
    "name": "Subgraph",
    "sources": [
      {
        "locator": "S",
        "url": "https://en.wikipedia.org/wiki/Glossary_of_graph_theory"
      }
    ],
    "tag": "0P11X5HKAX",
    "uses": [
      "0JD5C82QMB"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/0P11X5HKAX/",
  "links": [
    {
      "field": "defines",
      "target": "0WBFFC8XZ9"
    },
    {
      "field": "uses",
      "target": "0JD5C82QMB"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0P11X5HKAX.md",
  "msc": [
    "05C99"
  ],
  "name": "Subgraph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0P1/0P11X5HKAX.md",
  "status": null,
  "tag": "0P11X5HKAX",
  "uri": "m2://0P11X5HKAX",
  "url": "https://math2.tamnd.com/wiki/subgraph-definition/",
  "writing": {
    "tag": "0P11X5HKAX",
    "kind": "definition",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}