arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.11772math.CO
收藏

边度量维数小于度量维数的图

Graphs with the edge metric dimension smaller than the metric dimension

Martin Knor, Snjezana Majstorovic, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero

摘要:

给定一个连通图$G$,度量(分别为$G$的边度量)维数是唯一地标识每对不同顶点(分别为边缘)的$G$的距离向量到这样一个集合。本文解决了图的(边)度量维数的三个公开问题。具体地说,我们证明了,对于每一个$r,t\ge 2$与$r\ne t$,有$n_0$,这样,对于每一个$n\ge n_0$存在一个图$G$的顺序$n$与度量维数$r$和边缘度量维数$t$,其中除其他后果,显示存在无限多的图,其边缘度量维数是严格小于其度量维数。此外,我们还证明了不可能用图$G$的度量维数的某个常数因子来限制图$G$的边度量维数.

英文摘要:

Given a connected graph $G$, the metric (resp. edge metric) dimension of $G$ is the cardinality of the smallest ordered set of vertices that uniquely identifies every pair of distinct vertices (resp. edges) of $G$ by means of distance vectors to such a set. In this work, we settle three open problems on (edge) metric dimension of graphs. Specifically, we show that for every $r,t\ge 2$ with $r\ne t$, there is $n_0$, such that for every $n\ge n_0$ there exists a graph $G$ of order $n$ with metric dimension $r$ and edge metric dimension $t$, which among other consequences, shows the existence of infinitely many graph whose edge metric dimension is strictly smaller than its metric dimension. In addition, we also prove that it is not possible to bound the edge metric dimension of a graph $G$ by some constant factor of the metric dimension of $G$.

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

↑