Whole Even Sum Domination in Graphs

In this paper, a new concept of domination which is called whole even sum domination is presented, many bounded, properties, remarks, examples, are introduced. Furthermore, some operations as join and corona graphs of sum graphs are discussed. Finally, determined this number of the graph obtained from a graph G by the removal of all edges between any pair of neighbours of a vertex.