On a new class of identifying codes in graphs
DOI10.1016/J.IPL.2006.11.007zbMATH Open1185.05053OpenAlexW2046463303MaRDI QIDQ845971FDOQ845971
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.007
Recommendations
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Reliability, testing and fault tolerance of networks and computer systems (68M15) Other types of codes (94B60)
Cites Work
- Title not available (Why is that?)
- On a new class of codes for identifying vertices in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sequences of optimal identifying codes
- Two families of optimal identifying codes in binary Hamming spaces
- On identifying codes in the hexagonal mesh
- Bounds for codes identifying vertices in the hexagonal grid
- The minimum density of an identifying code in the king lattice.
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On the identification of sets of points in the square lattice
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Identifying codes with small radius in some infinite regular graphs
- Codes for identification in the king lattice
- Fault-tolerant locating-dominating sets
- On the density of identifying codes in the square lattice
- On Identifying Codes in the Triangular and Square Grids
- General bounds for identifying codes in some infinite regular graphs
- On identification in the triangular grid
Cited In (26)
- The identifying code number and Mycielski's construction of graphs
- The solid-metric dimension
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- Locating and identifying codes in circulant graphs
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- On robust identification in the square and King grids
- Bounds and extremal graphs for total dominating identifying codes
- A comparison of approaches for finding minimum identifying codes on graphs
- Optimal bounds on codes for location in circulant graphs
- Tolerant location detection in sensor networks
- On Iiro Honkala's contributions to identifying codes
- Watching systems in graphs: an extension of identifying codes
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On \(t\)-revealing codes in binary Hamming spaces
- Characterizing identifying codes from the spectrum of a graph or digraph
- Optimal identifying codes in the infinite 3-dimensional king grid
- On regular and new types of codes for location-domination
- Identification in \(\mathbb Z^2\) using Euclidean balls
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
- On a conjecture regarding identification in Hamming graphs
- Complexity results for identifying codes in planar graphs
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Topological code of graphs
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
- On strongly identifying codes
- Codes Identifying Vertices in 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)
