arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.13983math.COcs.DM
收藏

两棵树的笛卡儿积的广播数

Radio Number for the Cartesian Product of Two Trees

Devsi Bantva, Daphne Der-Fen Liu

摘要:

设$G$是简单连通图。对于任何两个顶点$u$和$v$,令$d(u,v)$表示$G$中$u$和$v$之间的距离,并且令$diam(G)$表示$G$的直径。$G$的放射标记是函数$f$,其向每个顶点分配非负整数(标记),使得对于$G$中的每个不同顶点$u$和$v$,它保持$|f(u)-f(v)| \geq diam(G) - d(u,v) +1$。$f$的跨度是$f(V)$的最大和最小标签之间的差异。由$rn(G)$表示的$G$的无线电编号是由$G$准许的无线电标记的最小跨度。本文给出了两棵树的笛卡儿积的无线数的一个下界。此外,我们提出了三个必要和充分条件,和三个充分条件的产品的两棵树达到这个界限。应用这些结果,我们确定了两星以及一条轨道与一颗星的笛卡儿积的射电数。

英文摘要:

Let $G$ be a simple connected graph. For any two vertices $u$ and $v$, let $d(u,v)$ denote the distance between $u$ and $v$ in $G$, and let $diam(G)$ denote the diameter of $G$. A radio-labeling of $G$ is a function $f$ which assigns to each vertex a non-negative integer (label) such that for every distinct vertices $u$ and $v$ in $G$, it holds that $|f(u)-f(v)| \geq diam(G) - d(u,v) +1$. The span of $f$ is the difference between the largest and smallest labels of $f(V)$. The radio number of $G$, denoted by $rn(G)$, is the smallest span of a radio labeling admitted by $G$. In this paper, we give a lower bound for the radio number of the Cartesian product of two trees. Moreover, we present three necessary and sufficient conditions, and three sufficient conditions for the product of two trees to achieve this bound. Applying these results, we determine the radio number of the Cartesian product of two stars as well as a path and a star.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑