The minimum identifying code graphs
From MaRDI portal
Publication:423972
DOI10.1016/j.dam.2012.01.015zbMath1278.94095OpenAlexW2082764347MaRDI QIDQ423972
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.015
Related Items (1)
Cites Work
- Unnamed Item
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Construction of codes identifying sets of vertices
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
- On a new class of codes for identifying vertices in graphs
This page was built for publication: The minimum identifying code graphs