Saved in:
Bibliographic Details
Main Authors: Hudry, Olivier, Junnila, Ville, Lobstein, Antoine
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2402.08264
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908942944174080
author Hudry, Olivier
Junnila, Ville
Lobstein, Antoine
author_facet Hudry, Olivier
Junnila, Ville
Lobstein, Antoine
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2402_08264
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle On Iiro Honkala's contributions to identifying codes
Hudry, Olivier
Junnila, Ville
Lobstein, Antoine
Discrete Mathematics
Combinatorics
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.
title On Iiro Honkala's contributions to identifying codes
topic Discrete Mathematics
Combinatorics
url https://arxiv.org/abs/2402.08264