Abstract
A set of vertices D is a dominating set for a graph G = ( V, E) if every vertex in V − D is adjacent to a vertex in D. A set of vertices D is a total dominating set if every vertex in V is adjacent to a vertex in D. Chang and Nemhauser gave a linear time algorithm to find a minimum cardinality dominating set for the κ-th power of a block graph. This paper presents a linear time algorithm for finding a minimum cardinality total dominating set of a block graph.
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.
