Minimum sizes of identifying codes in graphs differing by one edge
From MaRDI portal
Publication:2016394
DOI10.1007/S12095-013-0094-XzbMATH Open1294.94111OpenAlexW2073347666MaRDI QIDQ2016394FDOQ2016394
Olivier Hudry, Antoine Lobstein, Irène Charon, Iiro 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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a new class of codes for identifying vertices in graphs
- Identifying and locating-dominating codes on chains and cycles
- Identifying codes and locating-dominating sets on paths and cycles
- Minimum sizes of identifying codes in graphs differing by one vertex
- Extremal graphs for the identifying code problem
- Structural properties of twin-free graphs
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- Locating sensors in paths and cycles: the case of 2-identifying codes
- An optimal edge-robust identifying code in the triangular lattice
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- On identifying codes that are robust against edge changes
- On the Structure of Identifiable Graphs
Cited In (6)
- A comparison of approaches for finding minimum identifying codes on graphs
- Identifying codes with small radius in some infinite regular graphs
- On Iiro Honkala's contributions to identifying codes
- Locating-Domination and Identification
- Minimum sizes of identifying codes in graphs differing by one vertex
- Commutative rings introduce a class of identifiable graphs
This page was built for publication: Minimum sizes of identifying codes in graphs differing by one edge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016394)
