Locating and identifying codes in circulant graphs (Q2244371): Difference between revisions

Summary: Identifying and locating-dominating codes have been studied widely in circulant graphs. Recently, \textit{V. Junnila} et al. [Cryptogr. Commun. 11, No. 4, 621--640 (2019; Zbl 1462.94072)] studied identifying and locating-dominating codes in circulants \(C_n(1,d)\), \(C_n(1,d-1,d)\), and \(C_n(1,d-1,d,d+1)\). In this paper, identifying, locating, and self-identifying codes in the circulant graphs \(C_n(k,d)\), \(C_n(k,d-k, d)\), and \(C_n(k,d-k,d,d+k)\) are studied, and this extends the results of Junnila et al. [loc. cit.] to general cases.