This analysis uncovers exact values of pro-secure domination numbers in graph products, indicating mathematical properties.
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.
No takes yet. Share an insight, caveat, or question.
Kundaliya et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: