Johnson graphs are panconnected

S. Morteza Mirafzal, A. Heidari

For any given $n,m\in \mathbb{N}$ with $m<n$, the Johnson graph $J(n,m)$ is defined as the graph whose vertex set is $V=\{v\mid v\subseteq [n]=\{1,...,n\},|v|=m\}$, where two…