Now showing items 1-1 of 1
Semitotal domination of Harary graphs
(Tbilisi Centre for Mathematical Sciences, 2020)
Let G be a simple ﬁnite undirected and an isolate-free graph. A set S of vertices in G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex of S. ...