Minimum sizes of identifying codes in graphs differing by one edge
From MaRDI portal
Publication:2016394
DOI10.1007/s12095-013-0094-xzbMath1294.94111OpenAlexW2073347666MaRDI QIDQ2016394
Olivier Hudry, Irène Charon, Antoine C. Lobstein, Iiro S. Honkala
Publication date: 20 June 2014
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-013-0094-x
Related Items (max. 100)
Minimum sizes of identifying codes in graphs differing by one vertex ⋮ Locating-Domination and Identification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Identifying codes and locating-dominating sets on paths and cycles
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- Structural properties of twin-free graphs
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- Identifying and locating-dominating codes on chains and cycles
- An optimal edge-robust identifying code in the triangular lattice
- On identifying codes that are robust against edge changes
- Minimum sizes of identifying codes in graphs differing by one vertex
- Extremal graphs for the identifying code problem
- Locating sensors in paths and cycles: the case of 2-identifying codes
- On the Structure of Identifiable Graphs
- On a new class of codes for identifying vertices in graphs
This page was built for publication: Minimum sizes of identifying codes in graphs differing by one edge
