S-PATH DOMINATION IN SHADOW DISTANCE GRAPHS
minimal cardinality taken over all dominating sets of G. A dominating set of G is called a s-path dominating set of G if every path of length ... least one vertex in this dominating set. We denote a s-path dominating…

