{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nAn [[induced subgraph|0EREPBVG2G]] or full subgraph of a graph is a subgraph formed from a subset of vertices and from all of the edges that have both endpoints in the subset. Special cases include induced paths and induced cycles, induced subgraphs that are paths or cycles.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "4X24PT9QNR"
    ],
    "kind": "concept",
    "name": "Induced",
    "sources": [
      {
        "locator": "Glossary of graph theory, section I",
        "mention": "wikipedia://en/325802#BA8C",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:325802@r1373839425"
      }
    ],
    "tag": "GMVP38KJ4F"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/GMVP38KJ4F/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/GMVP38KJ4F.md",
  "msc": null,
  "name": "Induced",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/GMV/GMVP38KJ4F.md",
  "status": null,
  "tag": "GMVP38KJ4F",
  "uri": "m2://GMVP38KJ4F",
  "url": "https://math2.tamnd.com/wiki/induced/",
  "writing": {
    "tag": "GMVP38KJ4F",
    "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
      }
    ]
  }
}