@article {
author = {Rashmi, S.V. Divya and Arumugam, Subramanian and Bhutani, Kiran R. and Gartland, Peter},
title = {Perfect secure domination in graphs},
journal = {Categories and General Algebraic Structures with Applications},
volume = {7},
number = {Special Issue on the Occasion of Banaschewski's 90th Birthday (II)},
pages = {125-140},
year = {2017},
publisher = {Shahid Beheshti University},
issn = {2345-5853},
eissn = {2345-5861},
doi = {},
abstract = {Let $G=(V,E)$ be a graph. A subset $S$ of $V$ is a dominating set of $G$ if every vertex in $V\setminusÂ S$ is adjacent to a vertex in $S.$ A dominating set $S$ is called a secure dominating set if for each $v\in V\setminus S$ there exists $u\in S$ such that $v$ is adjacent to $u$ and $S_1=(S\setminus\{u\})\cup \{v\}$ is a dominating set. If further the vertex $u\in S$ is unique, then $S$ is called a perfect secure dominating set. The minimum cardinality of a perfect secure dominating set of $G$ is called the perfectÂ secure domination number of $G$ and is denoted by $\gamma_{ps}(G).$ In this paper we initiate a study of this parameter and present several basic results.},
keywords = {Secure domination,perfect secure domination,secure domination number,perfect secure domination number},
url = {http://cgasa.sbu.ac.ir/article_44926.html},
eprint = {http://cgasa.sbu.ac.ir/article_44926_4a0432bd29e2bbab421183f554f06243.pdf}
}