Various Bounds for Liar’s Domination Number

Abdollah Alimadadi, Doost Ali Mojdeh, and Nader Jafari Rad. "Various Bounds for Liar’s Domination Number." Discussiones Mathematicae Graph Theory 36.3 (2016): 629-641. <http://eudml.org/doc/285861>.

@article{AbdollahAlimadadi2016,
abstract = {Let G = (V,E) be a graph. A set S ⊆ V is a dominating set if Uv∈S N[v] = V , where N[v] is the closed neighborhood of v. Let L ⊆ V be a dominating set, and let v be a designated vertex in V (an intruder vertex). Each vertex in L ∩ N[v] can report that v is the location of the intruder, but (at most) one x ∈ L ∩ N[v] can report any w ∈ N[x] as the intruder location or x can indicate that there is no intruder in N[x]. A dominating set L is called a liar’s dominating set if every v ∈ V (G) can be correctly identified as an intruder location under these restrictions. The minimum cardinality of a liar’s dominating set is called the liar’s domination number, and is denoted by γLR(G). In this paper, we present sharp bounds for the liar’s domination number in terms of the diameter, the girth and clique covering number of a graph. We present two Nordhaus-Gaddum type relations for γLR(G), and study liar’s dominating set sensitivity versus edge-connectivity. We also present various bounds for the liar’s domination component number, that is, the maximum number of components over all minimum liar’s dominating sets.},
author = {Abdollah Alimadadi, Doost Ali Mojdeh, Nader Jafari Rad},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {liar’s domination; diameter; regular graph; Nordhaus-Gaddum; liar's domination},
language = {eng},
number = {3},
pages = {629-641},
title = {Various Bounds for Liar’s Domination Number},
url = {http://eudml.org/doc/285861},
volume = {36},
year = {2016},
}

TY - JOUR
AU - Abdollah Alimadadi
AU - Doost Ali Mojdeh
AU - Nader Jafari Rad
TI - Various Bounds for Liar’s Domination Number
JO - Discussiones Mathematicae Graph Theory
PY - 2016
VL - 36
IS - 3
SP - 629
EP - 641
AB - Let G = (V,E) be a graph. A set S ⊆ V is a dominating set if Uv∈S N[v] = V , where N[v] is the closed neighborhood of v. Let L ⊆ V be a dominating set, and let v be a designated vertex in V (an intruder vertex). Each vertex in L ∩ N[v] can report that v is the location of the intruder, but (at most) one x ∈ L ∩ N[v] can report any w ∈ N[x] as the intruder location or x can indicate that there is no intruder in N[x]. A dominating set L is called a liar’s dominating set if every v ∈ V (G) can be correctly identified as an intruder location under these restrictions. The minimum cardinality of a liar’s dominating set is called the liar’s domination number, and is denoted by γLR(G). In this paper, we present sharp bounds for the liar’s domination number in terms of the diameter, the girth and clique covering number of a graph. We present two Nordhaus-Gaddum type relations for γLR(G), and study liar’s dominating set sensitivity versus edge-connectivity. We also present various bounds for the liar’s domination component number, that is, the maximum number of components over all minimum liar’s dominating sets.
LA - eng
KW - liar’s domination; diameter; regular graph; Nordhaus-Gaddum; liar's domination
UR - http://eudml.org/doc/285861
ER -