TY  - JOUR
ID  - Nikodem2012
LB  - Nikodem2012
AU  - Nikodem, Mateusz
TI  - False alarms in fault-tolerant dominating sets in graphs
ST  - False alarms in fault-tolerant dominating sets in graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2012
VL  - 32
IS  - 4
SP  - 751
EP  - 760
DO  - http://dx.doi.org/10.7494/OpMath.2012.32.4.751
UR  - http://dx.doi.org/10.7494/OpMath.2012.32.4.751
AB  - We develop the problem of fault-tolerant dominating sets (liar's dominating sets) in graphs. Namely, we consider a new kind of fault - a false alarm. Characterization of such fault-tolerant dominating sets in three different cases (dependent on the classification of the types of the faults) are presented.
KW  - liar's dominating set
KW  - fault-tolerant dominating set
KW  - false alarm
KW  - Hamming distance
SN  - 1232-9274
ER  -