OUTER-CONNECTED SECURE DOMINATION OF SOME GRAPHS
Advances and Applications in Discrete Mathematics · 2026 · 43 (8) · 1063-1078
DOI: 10.17654/0974165826063 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, 2026. Verfasst von Diares S. Pis-an und 4 weiteren Autor:innen.
Abstract (Originalsprache)
Let \(G\) be a connected simple graph. Then a subset \(S\) of \(V(G)\) is a dominating set of \(G\) if for every \(u \in V(G) \backslash S\), there exists \(v \in S\) such that \(u v \in E(G)\). A dominating set \(S\) is an outer-connected dominating set of \(G\) if the subgraph induced by \(\langle V(G) \backslash S\rangle\) is connected. A dominating set \(S\) of \(V(G)\) is a secure dominating set of \(G\) if for every \(u \in V(G) \backslash S\), there exists \(v \in S\) such that \(u v \in E(G)\) and the set \((S \backslash\{v\}) \cup\{u\}\) is a dominating set of \(G\). A secure dominating set \(S\) is an outer-connected secure dominating set of \(G\) if the subgraph induced by \(\langle V(G) \backslash S\rangle\) is connected. The minimum cardinality of the outer-connected secure dominating set of \(G\), denoted by \(\widetilde{\gamma}_{S}(G)\) is called the outer-connected secure domination number of \(G\). In this paper, we initiate the study of the concept and give the outer-connected secure domination number of some special graphs.
Zitieren
APA
Pis-an, D. S., Estrada, G. M., Baterna, M. L., Enriquez, E. L., & Kiunisala, E. M. (2026). OUTER-CONNECTED SECURE DOMINATION OF SOME GRAPHS. Advances and Applications in Discrete Mathematics, 43(8), 1063-1078. https://doi.org/10.17654/0974165826063
Vancouver
Pis-an DS, Estrada GM, Baterna ML, Enriquez EL, Kiunisala EM. OUTER-CONNECTED SECURE DOMINATION OF SOME GRAPHS. Advances and Applications in Discrete Mathematics. 2026;43(8):1063-1078. doi:10.17654/0974165826063
BibTeX
@article{Pisan2026,
author = {Pis-an, Diares S. and Estrada, Grace M. and Baterna, Margie L. and Enriquez, Enrico L. and Kiunisala, Edward M.},
title = {OUTER-CONNECTED SECURE DOMINATION OF SOME GRAPHS},
journal = {Advances and Applications in Discrete Mathematics},
year = {2026},
volume = {43},
number = {8},
pages = {1063--1078},
doi = {10.17654/0974165826063}
}
EUVIMED