\input zb-basic
\input zb-ioport
\iteman{io-port 05982499}
\itemau{Wang, Haoli; Xu, Xirong; Yang, Yuansheng; Zhang, Baosheng; Luo, Meiqin; Wang, Guoqing}
\itemti{Radio number of ladder graphs.}
\itemso{Int. J. Comput. Math. 88, No. 10, 2026-2034 (2011).}
\itemab
Summary: Let $G$ be a connected graph with diameter diam$(G)$. The radio number for $G$, denoted by rn$(G)$, is the smallest integer $k$ such that there exists a function $f : V(G) \rightarrow \{0, 1, 2, \dots , k\}$ with the following satisfied for all vertices $u$ and $v:|f(u) - f(v)|\geq $ diam$(G) - d_{G}(u, v)+1$, where $d_{G}(u, v)$ is the distance between $u$ and $v$ in $G$. In this paper, we determine the radio number of ladder graphs.
\itemrv{~}
\itemcc{}
\itemut{channel assignment problem; distance-two labelling; multi-level distance labelling; radio number; radio labelling}
\itemli{doi:10.1080/00207160.2010.539211}
\end