On a new class of identifying codes in graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3906528 (Why is no real title available?)
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 861343 (Why is no real title available?)
- Bounds for codes identifying vertices in the hexagonal grid
- Codes for identification in the king lattice
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Fault-tolerant locating-dominating sets
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
- On Identifying Codes in the Triangular and Square Grids
- On a new class of codes for identifying vertices in graphs
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On identification in the triangular grid
- On identifying codes in the hexagonal mesh
- On the density of identifying codes in the square lattice
- On the identification of sets of points in the square lattice
- Sequences of optimal identifying codes
- The minimum density of an identifying code in the king lattice.
- Two families of optimal identifying codes in binary Hamming spaces
Cited in
(29)- Locating and identifying codes in circulant graphs
- The solid-metric dimension
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- Identification in \(\mathbb Z^2\) using Euclidean balls
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
- Codes Identifying Vertices in Graphs
- Combinatorial identification problems and graph powers
- Tolerant location detection in sensor networks
- On strongly identifying codes
- On Iiro Honkala's contributions to identifying codes
- Topological code of graphs
- On \(t\)-revealing codes in binary Hamming spaces
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- On robust identification in the square and King grids
- Characterizing identifying codes from the spectrum of a graph or digraph
- Bound of \(r\)-identifying and \(r\)-locating-dominating codes in the Kronecker product graph of \(cy_n\) and \(\overline{k}_2\)
- Optimal identifying codes in the infinite 3-dimensional king grid
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- The identifying code number and Mycielski's construction of graphs
- On a conjecture regarding identification in Hamming graphs
- Optimal bounds on codes for location in circulant graphs
- Bounds and extremal graphs for total dominating identifying codes
- On regular and new types of codes for location-domination
- A comparison of approaches for finding minimum identifying codes on graphs
- Adaptive identification in Torii in the King lattice
- Watching systems in graphs: an extension of identifying codes
- Complexity results for identifying codes in planar graphs
This page was built for publication: On a new class of identifying codes in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845971)
