PRO-SECURE DOMINATION IN CARTESIAN AND STRONG PRODUCT OF TWO GRAPHS
Advances and Applications in Discrete Mathematics · 2025
DOI: 10.17654/0974165825042 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, 2025. Verfasst von Saloni R. Kundaliya und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Let be a connected, finite and undirected graph. A set is a pro-secure dominating set (PSDS) of a graph , if is a dominating set of and for each a vertex such that and or (where and ) is a dominating set of graph . The minimum cardinality of pro-secure dominating set of graph is called the pro-secure domination number and it is denoted by . In this paper, we investigate exact values of pro-secure domination number in Cartesian product as well as strong product of two graphs.
Zitieren
APA
Kundaliya, S. R., & Bhatt, T. (2025). PRO-SECURE DOMINATION IN CARTESIAN AND STRONG PRODUCT OF TWO GRAPHS. Advances and Applications in Discrete Mathematics. https://doi.org/10.17654/0974165825042
Vancouver
Kundaliya SR, Bhatt T. PRO-SECURE DOMINATION IN CARTESIAN AND STRONG PRODUCT OF TWO GRAPHS. Advances and Applications in Discrete Mathematics. 2025. doi:10.17654/0974165825042
BibTeX
@article{Kundaliya2025,
author = {Kundaliya, Saloni R. and Bhatt, Tushharkumar},
title = {PRO-SECURE DOMINATION IN CARTESIAN AND STRONG PRODUCT OF TWO GRAPHS},
journal = {Advances and Applications in Discrete Mathematics},
year = {2025},
doi = {10.17654/0974165825042}
}
EUVIMED