Locating and Identifying Codes in Circulant Graphs

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, a...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Shu Jiao Song, Weiqian Zhang, Can Xu
Formato:	article
Lenguaje:	EN
Publicado:	Hindawi Limited 2021
Materias:	Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/b4522af42e784446a630ddb5620090fc
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:b4522af42e784446a630ddb5620090fc
record_format	dspace
spelling	oai:doaj.org-article:b4522af42e784446a630ddb5620090fc2021-11-08T02:36:22ZLocating and Identifying Codes in Circulant Graphs1607-887X10.1155/2021/4056910https://doaj.org/article/b4522af42e784446a630ddb5620090fc2021-01-01T00:00:00Zhttp://dx.doi.org/10.1155/2021/4056910https://doaj.org/toc/1607-887XIdentifying 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.Shu Jiao SongWeiqian ZhangCan XuHindawi LimitedarticleMathematicsQA1-939ENDiscrete Dynamics in Nature and Society, Vol 2021 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Mathematics QA1-939
spellingShingle	Mathematics QA1-939 Shu Jiao Song Weiqian Zhang Can Xu Locating and Identifying Codes in Circulant Graphs
description	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.
format	article
author	Shu Jiao Song Weiqian Zhang Can Xu
author_facet	Shu Jiao Song Weiqian Zhang Can Xu
author_sort	Shu Jiao Song
title	Locating and Identifying Codes in Circulant Graphs
title_short	Locating and Identifying Codes in Circulant Graphs
title_full	Locating and Identifying Codes in Circulant Graphs
title_fullStr	Locating and Identifying Codes in Circulant Graphs
title_full_unstemmed	Locating and Identifying Codes in Circulant Graphs
title_sort	locating and identifying codes in circulant graphs
publisher	Hindawi Limited
publishDate	2021
url	https://doaj.org/article/b4522af42e784446a630ddb5620090fc
work_keys_str_mv	AT shujiaosong locatingandidentifyingcodesincirculantgraphs AT weiqianzhang locatingandidentifyingcodesincirculantgraphs AT canxu locatingandidentifyingcodesincirculantgraphs
_version_	1718443131157872640

Locating and Identifying Codes in Circulant Graphs

Ejemplares similares