Radio labelling of two-branch trees

Abstract

A radio labelling of a graph $G$ is a mapping $f : V(G) \rightarrow \{0, 1, 2,\ldots\}$ such that $|f(u)-f(v)| \geq diam(G) + 1 - d(u,v)$ for every pair of distinct vertices $u,v$ of $G$, where $diam(G)$ is the diameter of $G$ and $d(u,v)$ is the distance between $u$ and $v$ in $G$. The radio number $rn(G)$ of $G$ is the smallest integer $k$ such that $G$ admits a radio labelling $f$ with $\max\{f(v):v \in V(G)\} = k$. The weight of a tree $T$ from a vertex $v \in V(T)$ is the sum of the distances in $T$ from $v$ to all other vertices, and a vertex of $T$ achieving the minimum weight is called a weight center of $T$. It is known that any tree has one or two weight centers. A tree is called a two-branch tree if the removal of all its weight centers results in a forest with exactly two components. In this paper we obtain a sharp lower bound for the radio number of two-branch trees which improves a known lower bound for general trees. We also give a necessary and sufficient condition for this improved lower bound to be achieved. Using these results, we determine the radio number of two families of level-wise regular two-branch trees.

Figures (3)

• Figure 1: Optimal radio labellings of $C(5,3)$ and $C(6,3)$ obtained from the proof of Theorem \ref{['thm:ds']}.
• Figure 2: Optimal radio labellings of $T_{2,4,4}^{1}$ and $T_{2,4,4}^{2}$ obtained from \ref{['f00']} and \ref{['f11']} using the linear order in the proof of Theorem \ref{['thm:level']}.
• Figure 3: Optimal radio labellings of $L_{3,3}^1$ and $L_{3,3}^2$ obtained from \ref{['f00']} and \ref{['f11']} using the linear order in the proof of Theorem \ref{['thm:ds']}.

Theorems & Definitions (37)

• Definition 1.1
• Lemma 2.1: Bantva2
• Lemma 2.2: Daphne1; see also Bantva2
• Theorem 2.3: Bantva2
• Definition 2.1
• Lemma 2.4
• Theorem 3.1
• Theorem 3.2
• Remark 3.1
• Remark 3.2