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

图的距离-k维数

The distance-k dimension of graphs

Jesse Geneson, Eunjeong Yi

摘要:

图$G$的度量维数$\dim(G)$是由机器人导航激发的已被广泛研究的图参数。设$G$是一个顶点集为$V(G)$的图,$d(x,y)$表示$G$中最短$x-y$路的长度.对于正整数$k$和不同的$x,y \in V(G)$,令$d_k(x,y)=\min\{d(x,y), k+1\}$和令$R_k\{x,y\}=\{z\in V(G): d_k(x,z) \neq d_k(y,z)\}$。子集$S\subseteq V(G)$是$G$的距离- $k$解析集,如果对于任何一对不同的$x,y \in V(G)$,$|S \cap R_k\{x,y\}| \ge 1$,并且$G$的距离- $k$维数$\dim_k(G)$是$G$的所有距离- $k$解析集上的最小基数.本文研究了图的距离-PDMATHAMR维数.我们得到了距离-PDMATHAMR维数的一般界.对所有的$k \ge 1$,我们用$\dim_k(G) \ge n-2$刻画了$n$阶连通图$G$.当$G$是圈或路时,我们确定了$\dim_k(G)$,并研究了顶点或边删除对图的距离- $k$维数的影响。

英文摘要:

The metric dimension, $\dim(G)$, of a graph $G$ is a graph parameter motivated by robot navigation that has been studied extensively. Let $G$ be a graph with vertex set $V(G)$, and let $d(x,y)$ denote the length of a shortest $x-y$ path in $G$. For a positive integer $k$ and for distinct $x,y \in V(G)$, let $d_k(x,y)=\min\{d(x,y), k+1\}$ and let $R_k\{x,y\}=\{z\in V(G): d_k(x,z) \neq d_k(y,z)\}$. A subset $S\subseteq V(G)$ is a distance-$k$ resolving set of $G$ if $|S \cap R_k\{x,y\}| \ge 1$ for any pair of distinct $x,y \in V(G)$, and the distance-$k$ dimension, $\dim_k(G)$, of $G$ is the minimum cardinality over all distance-$k$ resolving sets of $G$. In this paper, we study the distance-$k$ dimension of graphs. We obtain some general bounds for distance-$k$ dimension. For all $k \ge 1$, we characterize connected graphs $G$ of order $n$ with $\dim_k(G) \ge n-2$. We determine $\dim_k(G)$ when $G$ is a cycle or a path. We also examine the effect of vertex or edge deletion on the distance-$k$ dimension of graphs.

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

↑