TY - JOUR
AU - L. Benedict Michael Raj, K. A. Germina, J. Annaal Mercy,
PY - 2022/08/02
Y2 - 2023/12/11
TI - Strong Weak Secure Domination in Graphs
JF - Mathematical Statistician and Engineering Applications
JA - MSEA
VL - 71
IS - 3s3
SE - Articles
DO - 10.17762/msea.v71i3s3.347
UR - https://www.philstat.org/index.php/MSEA/article/view/347
SP - 56 - 62
AB - <p>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.</p>
ER -