On the Domination Number of Some Graph Operations

N .Y. Sari, I .H. Agustin, D Dafik


A set D of vertices of a simple graph G, that is a graph without loops and multiple edges, is called a dominating set if every vertex u ∈ V (G) − D is adja-cent to some vertex v ∈ D. The domination number of a graph G, denoted by γ(G), is the order of a smallest dominating set of G. A dominating set D with |D| = γ(G) is called a minimum dominating set. This research aims to char-acterize the domination number of some graph operations, namely joint graphs, coronation of graphs, graph compositions, tensor product of two graphs, and graph amalgamation. The results shows that most of the resulting domination numbers attain the given lower bound of γ(G).


Keywords: Dominating set, domination number,

Full Text:



  • There are currently no refbacks.