Watching systems in the King grid
From MaRDI portal
Publication:2376080
Recommendations
Cites work
- A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
- Bounds for codes identifying vertices in the hexagonal grid
- Codes for identification in the king lattice
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Identifying codes with small radius in some infinite regular graphs
- Maximum size of a minimum watching system and the graphs achieving the bound
- 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 \(\mathbb Z^2\) using translates of given patterns
- Watching systems in graphs: an extension of identifying codes
Cited in
(7)- On the watching number of graphs using discharging procedure
- The watching system as a generalization of identifying code
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
- Identifying codes and watching systems in Kneser graphs
- Locating-domination and identification
- Information retrieval and the average number of input clues
- Minimum density of identifying codes of king grids
This page was built for publication: Watching systems in the King grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376080)
