Identifying and locating-dominating codes on chains and cycles (Q1883609)

On a connected undirected graph \((V,E)\), an \(r\)-identifying code is a subset \(C\) of \(V\) such that the sets \(B_r(v)\cap C\) are distinct and nonempty for all \(v\in V\). A code is \(r\)-locating-dominating if this is true for all \(v\in V\backslash C\). This paper determines the minimum sizes (or densities) in many cases for these codes on finite and infinite chains and cycles.