TY  - BOOK
AU  - Menon, Manju K. 
AU  - Chithra, M. R. 
TI  - Secure domination of some graph operators (Journal Article)
SN  - 0019-5588
PY  - 2023///
CY  - New Delhi 
PB  - 
KW  - Secure set| Secure domination number| Generalized Mycielskian| Double graph Corona
N1  - ***______{For Hard Copy, Please visit Library.}________***


N2  - 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
UR  - https://doi.org/10.1007/s13226-022-00331-9
ER  -