On the semitotal dominating sets of graphs

A set D of vertices in an isolate-free graph G is a semitotal dominating set of G if D is a dominating set of G and every vertex in D is within distance ۲ from another vertex of D.The semitotal domination number of G is the minimum cardinality of a semitotal dominating set of G and is denoted by \gamma_{t۲}(G). In this paper after computation of semitotal domination number of specific graphs, we count the number of this kind of dominating sets of arbitrary size in some graphs.

کلیدواژه ها:

Dominating set ، semitotal domination number ، product