The minimum identifying code graphs
From MaRDI portal
Recommendations
- Extremal graphs for the identifying code problem
- Minimum identifying codes in some graphs differing by matchings
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
- Identifying codes in some subgraphs of the square lattice
- scientific article; zbMATH DE number 2186985
Cites work
- scientific article; zbMATH DE number 2081125 (Why is no real title available?)
- Construction of codes identifying sets of vertices
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- On a new class of codes for identifying vertices in graphs
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
Cited in
(16)- Minimal Graphs with a Specified Code Map Image
- Bounds on the identifying codes in trees
- Constructing codes identifying sets of vertices
- Choice identification of a graph
- The identifying code number and Mycielski's construction of graphs
- scientific article; zbMATH DE number 2186985 (Why is no real title available?)
- Minimum identifying codes in some graphs differing by matchings
- Construction of codes identifying sets of vertices
- A comparison of approaches for finding minimum identifying codes on graphs
- Bounds and extremal graphs for total dominating identifying codes
- Graphs where every \(k\)-subset of vertices is an identifying set
- Identifying codes of lexicographic product of graphs
- On the minimum size of an identifying code over all orientations of a graph
- The identifying code number and functigraphs
- Identifying codes on directed de Bruijn graphs
- Extremal graphs for the identifying code problem
This page was built for publication: The minimum identifying code graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423972)
