@article{L. Benedict Michael Raj, K. A. Germina_2022, title={Strong Weak Secure Domination in Graphs}, volume={71}, url={https://www.philstat.org.ph/index.php/MSEA/article/view/347}, abstractNote={<p>Let G be a graph. A subset X of V is a Secure Dominating Set(SDS)[5] if for every &nbsp;in , there exists some &nbsp;in &nbsp;adjacent to such that &nbsp;is a dominating set. A SDS of V is called a Strong Secure Dominating Set(SSDS) if for every &nbsp;in , there exists some &nbsp;in &nbsp;such that &nbsp;Similarly, Weak Secure Dominating Set(WSDS) is defined. The minimum cardinality of a strong(weak) secure dominating set is denoted by ()( . We initiate a study on these parameters and some bounds related to them are obtained.</p>}, number={3s3}, journal={Mathematical Statistician and Engineering Applications}, author={L. Benedict Michael Raj, K. A. Germina, J. Annaal Mercy,}, year={2022}, month={Aug.}, pages={56–62} }