{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0FFAYNMAJZ"
    }
  ],
  "body": "\n## Summary\n\nA connected graph is a graph in one piece, in which any two vertices are joined by a walk. Connectivity is a basic hypothesis of many results, such as the existence of spanning trees. The node [[connected graph|0FFAYNMAJZ]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C40"
    ],
    "name": "Connected graph",
    "sources": [
      {
        "locator": "Connected vertices and graphs",
        "url": "https://en.wikipedia.org/wiki/Connectivity_(graph_theory)"
      }
    ],
    "tag": "0KWFFMDF8T"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0KWFFMDF8T/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0KWFFMDF8T.md",
  "msc": [
    "05C40"
  ],
  "name": "Connected graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0KW/0KWFFMDF8T.md",
  "status": null,
  "tag": "0KWFFMDF8T",
  "uri": "m2://0KWFFMDF8T",
  "url": "https://math2.tamnd.com/wiki/connected-graph/",
  "writing": {
    "tag": "0KWFFMDF8T",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}