On the identification problems in products of cycles
From MaRDI portal
Publication:1420607
DOI10.1016/S0012-365X(03)00111-0zbMath1030.05098MaRDI QIDQ1420607
Publication date: 2 February 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
Optimal identifying codes of two families of Cayley graphs ⋮ Watching systems in graphs: an extension of identifying codes ⋮ Identifying codes of corona product graphs ⋮ Liar's domination
Cites Work
- Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Codes for identification in the king lattice
- Fault-tolerant locating-dominating sets
- On the identification of sets of points in the square lattice
- On the identification of vertices using cycles
- On a new class of codes for identifying vertices in graphs
- Sequences of optimal identifying codes
- Short dominating paths and cycles in the binary hypercube
- Bounds on identifying codes
- Identifying codes with small radius in some infinite regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the identification problems in products of cycles