A gap in the achievable radio number line (Q2447513)

Let \(G\) be a connected simple undirected graph. A radio labelling is a function \(c: V(G) \rightarrow \mathbb{Z}_+\) satisfying the radio condition \(d(u,v)+|c(u)-c(v)|\geq \mathrm{diam}(G) +1\), where \(\mathrm{diam}(G)\) is the diameter of the graph \(G\). For a radio labelling \(c\) of a graph \(G\), the span of \(c\), denoted by \(\mathrm{span}(c)\), is the largest integer in \(c(V(G))\). Minimizing span over all possible radio labellings of \(G\) gives the radio number \(\mathrm{rn}(G)\) of \(G\). A minimal radio labeling of \(G\) is a radio labeling \(c\) of \(G\) for which \(\mathrm{span}(c)=\mathrm{rn}(G)\). We say \(z\in \mathbb{Z}_+ \) is an achievable radio number when \(z=\mathrm{rn}(G)\) for some graph \(G\). The authors shows in this paper that the set of achievable radio numbers of graphs of order \(n\) is bounded above by \(\mathrm{rn}(P_n)\). Also, the paper demonstrates the existence of an unachievable radio number when \(n\) is odd.