On graphs admitting codes identifying sets of vertices
From MaRDI portal
Recommendations
Cited in
(18)- Identifying codes in the direct product of a complete graph and some special graphs
- Improved upper bounds for identifying codes in n-dimensional q-ary cubes
- New results of identifying codes in product graphs
- On minimum identifying codes in some Cartesian product graphs
- On cages admitting identifying codes
- Watching systems in graphs: an extension of identifying codes
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
- On identifying codes in the Cartesian product of a path and a complete graph
- Identifying codes in trees and planar graphs
- Complexity results for identifying codes in planar graphs
- The identifying code number and Mycielski's construction of graphs
- ID codes in Cartesian products of cliques
- Graphs where every \(k\)-subset of vertices is an identifying set
- Stopping sets of codes from complete graph
- Partial linear spaces and identifying codes
- Identifying codes in the direct product of a path and a complete graph
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Constructing codes identifying sets of vertices
This page was built for publication: On graphs admitting codes identifying sets of vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517160)
