Locating and Identifying Codes in Circulant Graphs

Abstract

Identifying and locating-dominating codes have been studied widely in circulant graphs. Recently, Ville Junnila et al. (Optimal bounds on codes for location in circulant graphs, Cryptography and Communications; 2019) studied identifying and locating-dominating codes in circulants Cn1,d, Cn1,d−1,d, and Cn1,d−1,d,d+1. In this paper, identifying, locating, and self-identifying codes in the circulant graphs Cnk,d, Cnk,d−k,d, and Cnk,d−k,d,d+k are studied, and this extends Junnila et al.’s results to general cases.