Locating and identifying codes in circulant graphs (Q2244371): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2021/4056910 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3208302137 / rank | |||
Normal rank | |||
Revision as of 00:16, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Locating and identifying codes in circulant graphs |
scientific article |
Statements
Locating and identifying codes in circulant graphs (English)
0 references
12 November 2021
0 references
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.
0 references
