arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.08147math.CO
收藏

图的顶点处的连通度量维数

The connected metric dimension at a vertex of a graph

Linda Eroh, Cong X. Kang, Eunjeong Yi

摘要:

度量维数的概念,$dim(G)$,图$G$,以及一些变种,现在研究得很好。在本文中,我们开始这个概念的局部分析,通过引入$cdim_G(v)$,\emph{the connected metric dimension of $G$ at a vertex $v$},它被定义如下:$G$的一组顶点$S$是一个\emph{resolving set},如果对于任何一对不同的顶点$x$和$y$的$G$,有一个顶点$z \in S$,使得$z$和$x$之间的距离不同于$G$中$z$和$y$之间的距离。如果$S$导出$G$的连通子图,则称其为$S$ \emph{connected}.然后,定义$cdim_G(v)$为包含顶点$v$的所有连通分解集的基数的最小值。\emph{connected metric dimension of $G$},用$cdim(G)$表示,是$\min\{cdim_G(v): v \in V(G)\}$。注意到,$1 \le dim(G) \le cdim(G) \le cdim_G(v) \le |V(G)|-1$的$G$的任何顶点$v$,我们表明存在一对$(G,v)$,使$cdim_G(v)$采取所有正整数值从$dim(G)$ $|V (G)|-1$,$v$在一个固定的图$G$变化。我们刻画了图$G$及其顶点$v$满足$cdim_G(v) \in \{1, |V(G)|-1\}$ .我们证明了$cdim(G)=2$蕴涵$G$是平面的,而众所周知,存在一个具有$dim(H)=2$的非平面图$H$。我们还刻画了树和单圈图$G$满足$cdim(G)=dim(G)$。我们证明了$cdim(G)-dim(G)$可以是任意大的。我们确定了几类图的$cdim(G)$和$cdim_G(v)$。我们进一步研究了顶点或边删除对连通度量维数的影响。最后,我们提出一些悬而未决的问题。

英文摘要:

The notion of metric dimension, $dim(G)$, of a graph $G$, as well as a number of variants, is now well studied. In this paper, we begin a local analysis of this notion by introducing $cdim_G(v)$, \emph{the connected metric dimension of $G$ at a vertex $v$}, which is defined as follows: a set of vertices $S$ of $G$ is a \emph{resolving set} if, for any pair of distinct vertices $x$ and $y$ of $G$, there is a vertex $z \in S$ such that the distance between $z$ and $x$ is distinct from the distance between $z$ and $y$ in $G$. We call a resolving set $S$ \emph{connected} if $S$ induces a connected subgraph of $G$. Then, $cdim_G(v)$ is defined to be the minimum of the cardinalities of all connected resolving sets which contain the vertex $v$. The \emph{connected metric dimension of $G$}, denoted by $cdim(G)$, is $\min\{cdim_G(v): v \in V(G)\}$. Noting that $1 \le dim(G) \le cdim(G) \le cdim_G(v) \le |V(G)|-1$ for any vertex $v$ of $G$, we show the existence of a pair $(G,v)$ such that $cdim_G(v)$ takes all positive integer values from $dim(G)$ to $|V (G)|-1$, as $v$ varies in a fixed graph $G$. We characterize graphs $G$ and their vertices $v$ satisfying $cdim_G(v) \in \{1, |V(G)|-1\}$. We show that $cdim(G)=2$ implies $G$ is planar, whereas it is well known that there is a non-planar graph $H$ with $dim(H)=2$. We also characterize trees and unicyclic graphs $G$ satisfying $cdim(G)=dim(G)$. We show that $cdim(G)-dim(G)$ can be arbitrarily large. We determine $cdim(G)$ and $cdim_G(v)$ for some classes of graphs. We further examine the effect of vertex or edge deletion on the connected metric dimension. We conclude with some open problems.

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

↑