On the ensemble of optimal identifying codes in a twin-free graph
From MaRDI portal
Publication:267807
DOI10.1007/S12095-015-0148-3zbMATH Open1333.05222OpenAlexW1456675268MaRDI QIDQ267807FDOQ267807
Authors: Olivier Hudry, Iiro Honkala, Antoine Lobstein 
Publication date: 11 April 2016
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-015-0148-3
Recommendations
- On the number of optimal identifying codes in a twin-free graph
- Minimum sizes of identifying codes in graphs differing by one vertex
- Structural properties of twin-free graphs
- Minimum sizes of identifying codes in graphs differing by one edge
- Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Cites Work
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Title not available (Why is that?)
- On a new class of codes for identifying vertices in graphs
- Title not available (Why is that?)
- On the ensemble of optimal dominating and locating-dominating codes in a graph
- On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
- Title not available (Why is that?)
- Induced subgraphs of Johnson graphs
- On the number of optimal identifying codes in a twin-free graph
- Graphs where every \(k\)-subset of vertices is an identifying set
Cited In (9)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes
- On the number of optimal identifying codes in a twin-free graph
- Induced paths in twin-free graphs
- On Iiro Honkala's contributions to identifying codes
- On the ensemble of optimal dominating and locating-dominating codes in a graph
- Minimum sizes of identifying codes in graphs differing by one edge
- Minimum sizes of identifying codes in graphs differing by one vertex
- Which graphs occur as \(\gamma\)-graphs?
- Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
This page was built for publication: On the ensemble of optimal identifying codes in a twin-free graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267807)
