{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **panconnected graph** is an undirected graph in which, for every two vertices $s$ and $t$, there exist [[paths|03NAMV1DHJ]] from $s$ to $t$ of every possible length from the distance $d(s,t)$ up to $n - 1$, where $n$ is the number of vertices in the graph. The concept of panconnectivity was introduced in 1975 by Yousef Alavi and James E. Williamson.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "P8EEMFZYEG"
    ],
    "kind": "concept",
    "name": "Panconnectivity",
    "same_as": {
      "wikidata": "Q7130383",
      "wikipedia": "Panconnectivity"
    },
    "sources": [
      {
        "locator": "Panconnectivity",
        "mention": "wikipedia://en/29341653",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:29341653@r1315797886"
      }
    ],
    "tag": "EMA9RK71GZ"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/EMA9RK71GZ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/EMA9RK71GZ.md",
  "msc": null,
  "name": "Panconnectivity",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/EMA/EMA9RK71GZ.md",
  "status": null,
  "tag": "EMA9RK71GZ",
  "uri": "m2://EMA9RK71GZ",
  "url": "https://math2.tamnd.com/wiki/panconnectivity/",
  "writing": {
    "tag": "EMA9RK71GZ",
    "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
      }
    ]
  }
}