Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Identification of Vertices and Edges Using Cycles
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Codes Identifying Sets of Vertices
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
Discrete Applied Mathematics
Identifying and locating-dominating codes on chains and cycles
European Journal of Combinatorics
Constructing codes identifying sets of vertices
Designs, Codes and Cryptography
Discriminating codes in (bipartite) planar graphs
European Journal of Combinatorics
Graph Theory
Links between discriminating and identifying codes in the binary hamming space
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
Nonrandom binary superimposed codes
IEEE Transactions on Information Theory
Optimal (r,≤3) -locating-dominating codes in the infinite king grid
Discrete Applied Mathematics
Identifying path covers in graphs
Journal of Discrete Algorithms
Maximum size of a minimum watching system and the graphs achieving the bound
Discrete Applied Mathematics
Choice identification of a graph
Discrete Applied Mathematics
| Hi-index | 0.04 |
We introduce the notion of watching systems in graphs, which is a generalization of that of identifying codes. We give some basic properties of watching systems, an upper bound on the minimum size of a watching system, and results on the graphs which achieve this bound; we also study the cases of the paths and cycles, and give complexity results.