AbstractA setDof vertices in a graph is said to be a dominating set if every vertex not inDis adjacent to some vertex inD.The domination number β(G) of a graphGis the size of a smallest dominating set.Gis called domination balanced if its vertex set can be partitioned into β(G) subsets so that each subset is a smallest dominating set of the complementGofG.The purpose of this paper is to characterize these graph