Johnson graphs are panconnected
S. Morteza Mirafzal, A. Heidari · arXiv (Cornell University) · 2019
For any given $n,m \in \mathbb{N}$ with $ m 2$ is panconnected if for every two vertices $u$ and $v$, there is a $u$-$v$ path of length $l$ for every integer $l$ with $d(u,v) \leq l \leq n-1$. In this paper, we prove that the Johnson graph $J(n,m)$ is a panconnected graph.