Some techniques to find large lower bound trees for the radio number

Devsi Bantva, P L Vihol

For a simple finite connected graph $G$, let $diam(G)$ and $d_G(u,v)$ denote the diameter of $G$ and distance between $u$ and $v$ in $G$, respectively. A radio labeling of a grap…