Abstract
A set S⊂V is a co-secure dominating set of a graph G=(V,E) if S is a dominating set, and for each u∈S there exists a vertex v∈V∖S such that uv∈E and (S∖{u})∪{v} is a dominating set. Note that |V|>1. The minimum cardinality of a co-secure dominating set in G is the co-secure domination number of G. In this paper, we propose a linear-time algorithm for finding the co-secure domination number of proper interval graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
