Abstract
An outer-connected dominating set in a graph G=(V,E) is a set S⊆V such that each vertex not in S is adjacent to at least one vertex in S and the subgraph induced by V∖S is connected. In Keil and Pradhan (2013) [6], Keil and Pradhan gave a linear-time algorithm for finding a minimum outer-connected dominating set in a proper interval graph. In this paper, we generalize their result to find a minimum outer-connected dominating set in an interval graph in linear time.
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.
