Abstract
Let Γ(G) = (V(Γ(G)),E(Γ(G))) be a zero-divisor graph. A dominating set S of V(Γ(G)) is a secure dominating set of Γ(G) if for every vertex x ∈V(Γ(G))−S, there exists y ∈ NΓ(G) (x)∩S such that (S−{y})∪{x} is a domination set. The minimum cardinality of a secure dominating set of Γ(G) is called secure domination number. In this paper, the secure domination number of zero-divisor graphs is obtained and also studied the structure of this parameter in Γ(Zn).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.