On minimum identifying codes in some Cartesian product graphs
From MaRDI portal
Publication:2409538
DOI10.1007/s00373-017-1813-4zbMath1371.05220arXiv1602.04089OpenAlexW2963438759MaRDI QIDQ2409538
Publication date: 11 October 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.04089
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Optimal identifying codes of two families of Cayley graphs ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ The general position number of Cartesian products involving a factor with small diameter ⋮ On a conjecture regarding identification in Hamming graphs
Cites Work
- On identifying codes in the Cartesian product of a path and a complete graph
- On the covering of vertices for fault diagnosis in hypercubes
- On identifying codes in binary Hamming spaces
- Identifying codes of Cartesian product of two cliques of the same size
- On the size of identifying codes in binary hypercubes
- Extremal graphs for the identifying code problem
- Identifying codes of the direct product of two cliques
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- The Domination Number of Grids
- On a new class of codes for identifying vertices in graphs
- On Identifying Codes in the Triangular and Square Grids
- On dominating the Cartesian product of a graph and K2
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On minimum identifying codes in some Cartesian product graphs
