WHOLE DOMINATION IN GRAPHS

WHOLE DOMINATION IN GRAPHS

Ahmed A. Omran, Thaer A. Ibrahim

[PDF]

Abstract

In this paper, a new parameter of domination number in graphs is de ned 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. Fur-thermore, the e ect of deletion vertex, edge, or add edge have been studied. Also, thee ect of the contracting an edge is determined. Finally, some operations between the two graphs have been calculated.

Keywords

Whole dominating set, Whole domination number, Deletion, Contracting an edge.