Strong Weak Secure Domination in Graphs

Authors

  • J. Annaal Mercy, L. Benedict Michael Raj, K. A. Germina

Abstract

Let G be a graph. A subset X of V is a Secure Dominating Set(SDS)[5] if for every  in , there exists some  in  adjacent to such that  is a dominating set. A SDS of V is called a Strong Secure Dominating Set(SSDS) if for every  in , there exists some  in  such that  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.

Downloads

Published

2022-08-02

How to Cite

L. Benedict Michael Raj, K. A. Germina, J. A. M. (2022). Strong Weak Secure Domination in Graphs. Mathematical Statistician and Engineering Applications, 71(3s3), 56–62. Retrieved from https://www.philstat.org.ph/index.php/MSEA/article/view/347