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

关于图的广播维

On the Broadcast Dimension of a Graph

Emily Zhang

摘要:

函数$f:V(G)\rightarrow \mathbb{Z}^+ \cup \{0\}$是图$G$的解析广播,如果对于任何不同的$x,y\in V(G)$,存在具有$f(z)>0$的顶点$z\in V(G)$,使得$\min\{d(x,z), f(z)+1\} \neq \min\{d(y,z), f(z)+1\}.$ $G$的广播维度是$G$的所有解析广播$f$上的$\sum_{v\in V(G)}f(v)$的最小值。广播维的概念是由Geneson和Yi作为度量维的一种变体提出的,在网络发现和机器人导航等领域有着广泛的应用。本文给出了无圈图的广播维数在顶点数上的一个渐近紧下界,并证明了Geneson和Yi关于一般图的广播维数在邻接维数上的一个下界是渐近紧的.我们还研究了在单边删除下图的广播维数的变化。我们证明了边删除下图的广播维数的加性增加和减少都是无界的。此外,我们证明了边删除下,任何图的广播维数增加的乘法因子最多为3。这些结果充分回答了Geneson和Yi提出的三个问题。

英文摘要:

A function $f:V(G)\rightarrow \mathbb{Z}^+ \cup \{0\}$ is a resolving broadcast of a graph $G$ if, for any distinct $x,y\in V(G)$, there exists a vertex $z\in V(G)$ with $f(z)>0$ such that $\min\{d(x,z), f(z)+1\} \neq \min\{d(y,z), f(z)+1\}.$ The broadcast dimension of $G$ is the minimum of $\sum_{v\in V(G)}f(v)$ over all resolving broadcasts $f$ of $G$. The concept of broadcast dimension was introduced by Geneson and Yi as a variant of metric dimension and has applications in areas such as network discovery and robot navigation. In this paper, we derive an asymptotically tight lower bound on the broadcast dimension of an acyclic graph in the number of vertices, and we show that a lower bound by Geneson and Yi on the broadcast dimension of a general graph in the adjacency dimension is asymptotically tight. We also study the change in the broadcast dimension of a graph under a single edge deletion. We show that both the additive increase and decrease of the broadcast dimension of a graph under edge deletion is unbounded. Moreover, we show that under edge deletion, the broadcast dimension of any graph increases by a multiplicative factor of at most 3. These results fully answer three questions asked by Geneson and Yi.

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

↑