Now showing items 1-3 of 3
Semitotal domination of some known trees
(International Mathematical Virtual Institute, 2021)
Let G = (V, E) be a graph without isolated vertices with vertex set V of order n = |V | and edge set E of size m = |E|. A vertex of a graph G is said to dominate itself and all its neighbors. A semitotal dominating set in ...
Semitotal domination number of some graph operations
(John Wiley and Sons Inc, 2021)
A semitotal dominating set S (abbreviated semi-TD-set) of graph G = (V, E) is a subset such that S is a dominating set and each vertex in the S is within 2 distance from the another vertex of S. The semitotal domination ...
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. ...