Minimum sizes of identifying codes in graphs differing by one vertex
From MaRDI portal
Publication:2392684
DOI10.1007/S12095-012-0078-2zbMATH Open1335.94099OpenAlexW4244127482MaRDI QIDQ2392684FDOQ2392684
Authors: Irène Charon, Olivier Hudry, Iiro Honkala, Antoine 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
Recommendations
- Minimum sizes of identifying codes in graphs differing by one edge
- On the number of optimal identifying codes in a twin-free graph
- Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
- Structural properties of twin-free graphs
- On the ensemble of optimal identifying codes in a twin-free graph
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Cites Work
- On a new class of codes for identifying vertices in graphs
- Title not available (Why is that?)
- 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 edge
- Extremal graphs for the identifying code problem
- Structural properties of twin-free graphs
- On 2-edge robust \(r\)-identifying codes in the king grid
- 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
- Title not available (Why is that?)
- On identifying codes that are robust against edge changes
- On the Structure of Identifiable Graphs
- Title not available (Why is that?)
Cited In (13)
- On the ensemble of optimal identifying codes in a twin-free graph
- On the number of optimal identifying codes in a twin-free graph
- Minimum identifying codes in some graphs differing by matchings
- A comparison of approaches for finding minimum identifying codes on graphs
- Induced paths in twin-free graphs
- Locating-domination and identification
- Identifying codes with small radius in some infinite regular graphs
- Structural properties of twin-free graphs
- On Iiro Honkala's contributions to identifying codes
- Optimal identification of sets of edges using 2-factors
- Minimum sizes of identifying codes in graphs differing by one edge
- Commutative rings introduce a class of identifiable graphs
- Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
This page was built for publication: Minimum sizes of identifying codes in graphs differing by one vertex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392684)
