Locating and Identifying Codes in Circulant Graphs

Shu Jiao Song, Weiqian Zhang, Can Xu and Akbar Ali

Discrete Dynamics in Nature and Society, 2021, vol. 2021, 1-9

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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ddns/2021/4056910.pdf (application/pdf)
http://downloads.hindawi.com/journals/ddns/2021/4056910.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:4056910

DOI: 10.1155/2021/4056910

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().