Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
From MaRDI portal
Publication:1406036
DOI10.1016/S0166-218X(02)00579-6zbMath1030.05067MaRDI QIDQ1406036
Mark G. Karpovsky, Simon N. Litsyn, Iiro S. Honkala
Publication date: 9 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
94B60: Other types of codes
Related Items
On the path separation number of graphs, Identifying path covers in graphs, Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs, On the identification problems in products of cycles, Paths and cycles identifying vertices in twisted cubes, Watching systems in graphs: an extension of identifying codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum density of an identifying code in the king lattice.
- Families of optimal codes for strong identification
- Bounds for Codes Identifying Vertices in the Hexagonal Grid
- On codes identifying vertices in the two-dimensional square lattice with diagonals
- On a new class of codes for identifying vertices in graphs
- Sequences of optimal identifying codes
- Two families of optimal identifying codes in binary Hamming spaces
- On codes identifying sets of vertices in Hamming spaces
- Bounds on identifying codes
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs