False alarms in fault-tolerant dominating sets in graphs

• Autorzy: Nikodem M.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

liar’s dominating set; fault-tolerant dominating set; false alarm; hamming distance

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2012
• Tom: Vol. 32, no. 4
• Strony: 751--760
• Opis fizyczny: Bibliogr. 7 poz., rys.

Twórcy

autor

Nikodem M.

• AGH University of Science and Technology Faculty of Applied Mathematics al. Mickiewicza 30, 30-059 Krakow, Poland,

Bibliografia

• [1] J. Daintith, E. Wright, eds, A Dictionary of Computing, Oxford University Press, USA;6th ed., 2010, p. 87.
• [2] F. Harary, R.A. Melter, On the metric dimension of a graph, Ars Combin. 2 (1976), 191–195.
• [3] M.L. Roden, P.J. Slater, Liar’s domination in graphs, Discrete Math. 309 (2009) 19, 5884–5890.
• [4] P.J. Slater, Domination and location in acyclic graphs, Networks 17 (1987), 55–64.
• [5] P.J. Slater, Domination and reference sets in graphs, J. Math. Phys. Sci. 22 (1988), 445–455.
• [6] P.J. Slater, Fault-tolerant locating-dominating sets, Discrete Math. 249 (2002), 179–189.
• [7] P.J. Slater, Liar’s domination, Networks 54 (2009) 2, 70–74.