|
D. Auger, I. Charon, O. Hudry, A. Lobstein, Watching systems in graphs: an extension of identifying codes, Discrete Appl. Math. 161 (2013) 1674-1685.
I. Charon, O. Hudry, A. Lobstein, Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard, Theoret. Comput. Sci. 290 (3) (2003) 2109-2120.
T.-P. Chang, L.-D. Tong, Choice identification of a graph, Discrete Appl. Math. 167 (2014) 61-71.
S. Gravier, J. Moncel, Construction of codes identifying sets of vertices, Electron. J. Combin. 12 (2005) R13.
M.G. Karpovsky, K. Chakrabarty, L.B. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Trans. Inform. Theory 44 (2) (1998) 599-611.
T. Laihonen, S. Ranto, Codes identifying sets of vertices, Lecture Notes in Comput. Sci. 2227 (2001) 82-91.
J. Moncel, On graphs on n vertices having an identifying code of cardinality $lceil log_{2}{(n + 1)} ceil$, Discrete Appl. Math. 154 (14) (2006) 2032-2039.
A. Raspaud, L.-D. Tong, Minimum identifying code graphs, Discrete Appl. Math. 160 (9) (2012) 1385-1389.
|