Abstract
A set C of vertices in a graph G = (V, E) is an identifying code if it is dominating and any two vertices of V are dominated by distinct sets of codewords. This paper presents a survey of Iiro Honkala's contributions to the study of identifying codes with respect to several aspects: complexity of computing an identifying code, combinatorics in binary Hamming spaces, infinite grids, relationships between identifying codes and usual parameters in graphs, structural properties of graphs admitting identifying codes, and number of optimal identifying codes.
| Original language | English |
|---|---|
| Pages (from-to) | 165-196 |
| Number of pages | 32 |
| Journal | Fundamenta Informaticae |
| Volume | 191 |
| Issue number | 3-4 |
| DOIs | |
| Publication status | Published - 22 Jul 2024 |
Keywords
- binary Hamming spaces
- classic parameters of graphs
- combinatorics
- complexity
- domination
- graph theory
- identifying codes
- infinite grids
- number of optimal solutions
- separation
- twin-free graphs
Fingerprint
Dive into the research topics of 'On Iiro Honkala's Contributions to Identifying Codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver