False alarms in fault-tolerant dominating sets in graphs

Abstract

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.

Keywords

• liar's dominating set
• fault-tolerant dominating set
• false alarm
• Hamming distance