---
tag: EMA9RK71GZ
kind: concept
name: Panconnectivity
sources:
  - wikipedia: en:29341653@r1315797886
    locator: Panconnectivity
    note: adopted
    mention: wikipedia://en/29341653
    sections: [Summary]
same_as:
  wikidata: Q7130383
  wikipedia: Panconnectivity
inventory: [P8EEMFZYEG]
---

## Summary

In 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.