Optimal bounds on codes for location in circulant graphs
From MaRDI portal
Publication:2311421
DOI10.1007/s12095-018-0316-3zbMath1462.94072arXiv1802.01325OpenAlexW2963460868MaRDI QIDQ2311421
Ville Junnila, Tero Laihonen, Gabrielle Paris
Publication date: 10 July 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.01325
Bounds on codes (94B65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)
Related Items (2)
Locating and identifying codes in circulant graphs ⋮ Improved lower bound for locating-dominating codes in binary Hamming spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Identifying codes and locating-dominating sets on paths and cycles
- On locating--dominating sets in infinite grids
- On a new class of identifying codes in graphs
- Identifying codes of cycles with odd orders
- Fault-tolerant locating-dominating sets
- Identifying and locating-dominating codes on chains and cycles
- Optimal identifying codes in cycles and paths
- An optimal locating-dominating set in the infinite triangular grid
- Locating and identifying codes in circulant networks
- Locating sensors in paths and cycles: the case of 2-identifying codes
- Identifying codes of cycles
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- Solving Two Conjectures regarding Codes for Location in Circulant Graphs
- Minimum Number of Input Clues in Robust Information Retrieval
- 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: Optimal bounds on codes for location in circulant graphs
