Abstract
In this paper, a new parameter of domination number in graphs is defined which is called whole domination number denoted by ?wh(G). Some bounds of whole domination number and the number of edges depend on it has been established. Furthermore, the effect of deletion vertex, edge, or add edge have been studied. Also, the effect of the contracting an edge is determined. Finally, some operations between the two graphs have been calculated.