Restrained Semitotal Domination in Various Graph Structures

Restrained domination involves a vertex partitioning and considers the parameter domination on graph. Recently, another parameter called semitotal domination was introduced which strengthens domination while relaxing total and weakly connected domination constraints. In this paper, we studied a new parameter of domination a combination of the aforementioned domination parameters called the restrained semitotal domination of graphs. Also, we have discussed some characterization type results with respect to certain family of graphs and graph operations.