Hangable Graphs

Mateusz Miotk, Jerzy Topp

Let $G=(V_G,E_G)$ be a connected graph. The distance $d_G(u,v)$ between vertices $u$ and $v$ in $G$ is the length of a shortest $u-v$ path in $G$. The eccentricity of a vertex $v$…