Some techniques to find large lower bound trees for the radio number

arXiv2303.06432MaRDI QIDQ6429199FDOQ6429199

Authors: D. D. Bantva, P. L. Vihol 

Publication date: 11 March 2023

Abstract: For a simple finite connected graph $G$, let $diam(G)$ and $d_G(u,v)$ denote the diameter of $G$ and distance between $u$ and $v$ in $G$, respectively. A radio labeling of a graph $G$ is a mapping $f$ : $V(G)ightarrow0,1,2,\mathrm{...}$ such that $|f(u)-f(v)|geqdiam(G)+1-d_G(u,v)$ holds for every pair of distinct vertices $u,v$ of $G$. The radio number $rn(G)$ of $G$ is the smallest number $k$ such that $G$ has radio labeling $f$ with max$f(v):vinV(G)$ = $k$. Bantva et al. gave a lower bound for the radio number of trees in [Lemma 3.1, Discrete Applied Math.,217(2017),110-122] and, a necessary and sufficient condition to achieve this lower bound in [Theorem 3.2, Discrete Applied Math.,217(2017),110-122]. Denote the lower bound for the radio number of trees given in [Lemma 3.1, Discrete Applied Math.,217(2017),110-122] by $lb(T)$. A tree $T$ is called a lower bound tree for the radio number if $rn(T)$ = $lb(T)$. In this paper, we construct some large lower bound trees for the radio number using known lower bound trees.

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: Some techniques to find large lower bound trees for the radio number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6429199)