The Radio numbers of all graphs of order $n$ and diameter $n-2$

Katherine Benson, Matthew Porter, Maggy Tomova

A radio labeling of a connected graph $G$ is a function $c:V(G)\to {\mathbb{Z}}_{+}$ such that for every two distinct vertices $u$ and $v$ of $G$ $$\text{distance}(u,v)+|c(u)-c(v)|\geq…