Locating and identifying codes in circulant graphs

DOI10.1155/2021/4056910zbMath1486.94187OpenAlexW3208302137MaRDI QIDQ2244371

Can Xu, Weiqian Zhang, Shu Jiao Song

Publication date: 12 November 2021

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/4056910

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other types of codes (94B60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• On locating--dominating sets in infinite grids
• On a new class of identifying codes in graphs
• Improved bounds on identifying codes in binary Hamming spaces
• Fault-tolerant locating-dominating sets
• Tolerant location detection in sensor networks
• Optimal bounds on codes for location in circulant graphs
• On cages admitting identifying codes
• Locating and identifying codes in circulant networks
• Locating and total dominating sets in trees
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• Identifying and Locating–Dominating Codes in (Random) Geometric Networks
• On a new class of codes for identifying vertices in graphs
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• Identifying codes with small radius in some infinite regular graphs

This page was built for publication: Locating and identifying codes in circulant graphs