A Semi-Total Domination Number of a Graph

Abstract

This thesis work on the two parameters that is very important domination parameters, one parameter is known as domination number and other parameter is called as total domination number. S is defined as a set of vertices in a graph G. We characterize a set S of vertices in a graph G with no segregated vertices to be a semitotal overwhelming arrangement of G in the event that it is a ruling arrangement of G and furthermore every vertex in S is inside separation 2 of another vertex of S. The semitotal domination number, indicated by is the base cardinality of a semitotal ruling arrangement of G. We demonstrate that on the off chance that G is an associated graph on n ? 4 vertices, at that point and we describe the trees and diagrams of least degree 2 arriving at this bound.