Semitotal domination number of some graph operations

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 number, denoted by ?t2(G), is the minimum cardinality taken over all semitotal dominating sets of G. In this paper, we examine the semitotal domination number of graphs obtained by some graph operations such as corona, join, modular product, and lexicographic product. © 2021 Wiley Periodicals LLCEge Üniversitesi: FDK?2018?20266The author is thankful to the editors and the anonymous reviewers for their valuable comments. This paper is supported by Ege University PhD Scientific Research Project (BAP) under project number FDK?2018?20266