2 problems

Let $C_n(1,d)$ be the circulant graph on vertex set $\mathbb{Z}_n$ in which vertices at cyclic distances $1$ or $d$ are adjacent, with $d>3$. Identifying and locating-dominating co…

Let $C_n(1,3)$ be the circulant graph on vertex set $\mathbb{Z}_n$ in which vertices at cyclic distances $1$ or $3$ are adjacent. A locating-dominating code is a dominating vertex…