Radio Number for the Cartesian Product of Two Trees

Devsi Bantva, Daphne Der-Fen Liu

Let $G$ be a simple connected graph. For any two vertices $u$ and $v$, let $d(u,v)$ denote the distance between $u$ and $v$ in $G$, and let $diam(G)$ denote the diameter of $G$. A…