Liar’s domination in graphs under some operations
2017 ◽
Vol 48
(1)
◽
pp. 61-71
◽
Keyword(s):
A set $S\subseteq V(G)$ is a liar's dominating set ($lds$) of graph $G$ if $|N_G[v]\cap S|\geq 2$ for every $v\in V(G)$ and $|(N_G[u]\cup N_G[v])\cap S|\geq 3$ for any two distinct vertices $u,v \in V(G)$. The liar's domination number of $G$, denoted by $\gamma_{LR}(G)$, is the smallest cardinality of a liar's dominating set of $G$. In this paper we study the concept of liar's domination in the join, corona, and lexicographic product of graphs.
2021 ◽
Vol 14
(3)
◽
pp. 829-841
2018 ◽
Vol 11
(05)
◽
pp. 1850075
2021 ◽
Vol 14
(3)
◽
pp. 803-815
2021 ◽
Vol 14
(3)
◽
pp. 1015-1023
Keyword(s):
2020 ◽
Vol 12
(05)
◽
pp. 2050066
2021 ◽
Vol 14
(2)
◽
pp. 578-589
2019 ◽
Vol 12
(4)
◽
pp. 1410-1425
2020 ◽
Vol 13
(4)
◽
pp. 779-793