Linear algorithms on Steiner domination of trees

Yueming Shen, Chengye Zhao, Chenglin Gao +1

A set of vertices $W$ in a connected graph $G$ is called a Steiner dominating set if $W$ is both Steiner and dominating set. The Steiner domination number ${\gamma }_{st}(G)$ is the minimu…