On the (independent) semitotal domination in subdivision, middle, and central graphs

Source abstract

A dominating set $D$ of a nontrivial connected graph $G$ is called a semitotal dominating set of $G$ if every vertex in $D$ is at distance at most two from another vertex in $D$. If, in addition, $D$ is an independent set, then $D$ is called an independent semitotal dominating set of $G$. The (independent) semitotal domination number of $G$ is the minimum cardinality among all (independent) semitotal dominating sets of $G$. In this paper, we obtain closed formulas for these parameters in the following three well-known graph operators defined from a connected graph: the subdivision, middle, and central graphs.