Paper detail

Metric dimension, doubly resolving set and strong metric dimension for $(C_n\Box P_k)\Box P_m$

A subset $Q = \{q_1, q_2, ..., q_l\}$ of vertices of a connected graph $G$ is a doubly resolving set of $G$ if for any various vertices $x, y \in V(G)$ we have $r(x|Q)-r(y|Q)\neqλI$, where $λ$ is an integer, and $I$ indicates the unit $l$- vector $(1,..., 1)$. A doubly resolving set of vertices of graph $G$ with the minimum size, is denoted by $ψ(G)$. In this work, we will consider the computational study of some resolving sets with the minimum size for $(C_n\Box P_k)\Box P_m$.