On oriented \(L(p,1)\)-labeling (Q2636569)

The oriented \(L(p,q)\)-labeling span \(\lambda _{p,q}^{o}(\overrightarrow{G})\) of an oriented graph \(\overrightarrow{G}\) is the minimum \(k\) such that \(\overrightarrow{G}\) admits an oriented \(k\)-\(L(p,q)\)-labeling. \ For an undirected graph \(G,\) \(\lambda _{p,q}^{o}=\max\{\lambda _{p,q}^{o}(\overrightarrow{G}),\) where \(\overrightarrow{G}\) is an orientation of \(G\}\). The main result of this paper claims that for the family of graphs \(G_{\Delta }\) with maximum degree \(\Delta \geq 2\), it is \(2^{\Delta /2}-1\leq \lambda _{p,q}^{o}(G_{\Delta })\leq \Delta ^{2}2^{\Delta +1}+2p\Delta\). This bound improves on previous results of other authors. For the entire collection see [Zbl 1382.68013].