Radial radio number of hexagonal and its derived networks (Q2238439)

Summary: A mapping \(\operatorname{\daleth}:V\left(G\right)\longrightarrow N \bigcup\left\{0\right\}\) for a connected graph \(G=\left(V, E\right)\) is called a radial radio labelling if it satisfies the inequality \(\left| \operatorname{\daleth} \left(x\right) - \operatorname{\daleth} \left(y\right)\right|+d\left(x, y\right)\geq\mathrm{rad}\left(G\right)+1\), \(\forall x,y\in V\left(G\right)\), where \(\mathrm{rad}\left(G\right)\) is the radius of the graph \(G\). The radial radio number of \(\operatorname{\daleth}\) denoted by \(rr\left( \operatorname{\daleth} \right)\) is the maximum number mapped under \(\operatorname{\daleth}\). The radial radio number of \(G\) denoted by \(rr\left(G\right)\) is equal to min \(\{rr\left( \operatorname{\daleth} \right)/\operatorname{\daleth}\) is a radial radio labelling of \(G\}\).