Minimum sizes of identifying codes in graphs differing by one vertex
From MaRDI portal
Publication:2392684
DOI10.1007/s12095-012-0078-2zbMath1335.94099MaRDI QIDQ2392684
Irène Charon, Olivier Hudry, Iiro S. Honkala, Antoine C. Lobstein
Publication date: 2 August 2013
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-012-0078-2
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
94B25: Combinatorial codes
Related Items
Minimum identifying codes in some graphs differing by matchings, Optimal identification of sets of edges using 2-factors, Minimum sizes of identifying codes in graphs differing by one edge, Locating-Domination and Identification
Cites Work
- 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
- Minimum sizes of identifying codes in graphs differing by one edge
- On identifying codes that are robust against edge changes
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
