[00979] Optimal radio channel assignment to transmitters in a network by graph labeling approach
Session Time & Room : 5C (Aug.25, 13:20-15:00) @G302
Type : Contributed Talk
Abstract : An optimal radio channel assignment to transmitters in a network is modelled by graph labeling approach. A radio labeling of a graph $G$ is a mapping $f : V(G) \rightarrow \{0,1,2,\ldots\}$ satisfying $|f(u)-f(v)| \geq diam(G)+1-d(u,v)$ for all $u,v \in V(G)$. The radio number $rn(G)$ of $G$ is the smallest number $k$ such that $G$ has radio labeling $f$ with $\max\{f(v) : v \in V(G)\}=k$. We present our recent results on optimal radio labelings of graphs.
