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...
Guardado en:
Autores principales: | Shu Jiao Song, Weiqian Zhang, Can Xu |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Hindawi Limited
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/b4522af42e784446a630ddb5620090fc |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
On Laplacian Equienergetic Signed Graphs
por: Qingyun Tao, et al.
Publicado: (2021) -
On Omega Index and Average Degree of Graphs
por: Sadik Delen, et al.
Publicado: (2021) -
The Optimal Graph Whose Least Eigenvalue is Minimal among All Graphs via 1-2 Adjacency Matrix
por: Lubna Gul, et al.
Publicado: (2021) -
Computing Gutman Connection Index of Thorn Graphs
por: Muhammad Javaid, et al.
Publicado: (2021) -
On the Exact Values of HZ-Index for the Graphs under Operations
por: Dalal Awadh Alrowaili, et al.
Publicado: (2021)