A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Algorithmic Aspects of Semitotal Domination in Graphs
[article]
2017
arXiv
pre-print
For a graph G=(V,E), a set D ⊆ V is called a semitotal dominating set of G if D is a dominating set of G, and every vertex in D is within distance 2 of another vertex of D. The Minimum Semitotal Domination problem is to find a semitotal dominating set of minimum cardinality. Given a graph G and a positive integer k, the Semitotal Domination Decision problem is to decide whether G has a semitotal dominating set of cardinality at most k. The Semitotal Domination Decision problem is known to be
arXiv:1711.10891v1
fatcat:tash2wg3lzekbip73tqaarfeim