Secure domination of some graph operators (Journal Article)
- New Delhi : , 2023
- 1170-1176p.
- Indian Journal of Pure and Applied Mathematics , Volume 54: Number 4, December 2023 .
***______________***
Abstract: A set is said to be secure if the security condition, for every, holds. Now, a set is secure dominating if it is both secure and dominating. The secure domination number of G is the minimum cardinality of a secure dominating set in G. In this paper, we have obtained results regarding the secure domination number of some graph operators.