The semitotal domination problem in block graphs
In this paper, the authors studied the semitotal dominating set in block graphs. Firstly, they considered the complexity of finding a minimum semi-TD-set in block graphs and presented the linear time algorithm for computing a minimum semitotal dominating set. Moreover, they have shown the semitotal domination problem remains NP-complete for undirected path graphs which is a subclass of chordal graphs. These studies are interesting to explore the complexity of finding a minimum semitotal dominating set of strongly chordal graphs
scientific article; zbMATH DE number 7451250