Identifying codes and locating-dominating sets on paths and cycles

Chunxia Chen, Changhong Lu, Zhengke Miao

Let $G=(V,E)$ be a graph and let $r\ge 1$ be an integer. For a set $D\subseteq V$, define $N_r[x]=\{y\in V:d(x,y)\le r\}$ and $D_r(x)=N_r[x]\cap D$, where $d(x,y)$ denot…