Pages that link to "Item:Q845971"
From MaRDI portal
The following pages link to On a new class of identifying codes in graphs (Q845971):
Displaying 26 items.
- A comparison of approaches for finding minimum identifying codes on graphs (Q296102) (← links)
- Adaptive identification in Torii in the King lattice (Q540127) (← links)
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Combinatorial identification problems and graph powers (Q766254) (← links)
- On robust identification in the square and King grids (Q860410) (← links)
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice (Q882790) (← links)
- Topological code of graphs (Q1188076) (← links)
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036) (← links)
- On strongly identifying codes (Q1613540) (← links)
- On regular and new types of codes for location-domination (Q1671339) (← links)
- On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
- Locating and identifying codes in circulant graphs (Q2244371) (← links)
- On \(t\)-revealing codes in binary Hamming spaces (Q2272993) (← links)
- Tolerant location detection in sensor networks (Q2280052) (← links)
- The solid-metric dimension (Q2285129) (← links)
- Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid (Q2380847) (← links)
- Characterizing identifying codes from the spectrum of a graph or digraph (Q2418997) (← links)
- Optimal identifying codes in the infinite 3-dimensional king grid (Q2441660) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Codes Identifying Vertices in Graphs (Q3439339) (← links)
- The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
