Abstract
A subset S of vertices in a graph G is a secure dominating set of G if S is a dominating set of G and, for each vertex u⁄∈S, there is a vertex v∈S such that uv is an edge and (S∖{v})∪{u} is also a dominating set of G. We show that if G is a maximal outerplane graph of n vertices, then G has a secure dominating set of size at most ⌈3n∕7⌉. Moreover, if a maximal outerplane graph G has no internal triangles, it has a secure dominating set of size at most ⌈n∕3⌉. Finally, we show that any secure dominating set of a maximal outerplane graph without internal triangles has more than n∕4 vertices.
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.
