The distance-k dimension of graphs

Abstract

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)\ne 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.

References in corpus (2)

• On the Metric Dimension of Cartesian Products of Graphs
• Broadcast Dimension of Graphs

Cited by in corpus (3)

• Distance-$k$ locating-dominating sets in graphs
• The fractional $k$-truncated metric dimension of graphs
• Sharp bound on the threshold metric dimension of trees