The relation of and

Abstract

Every graph G with vertex V and edge E usually referred to as G = (V, E) in this research is a simple, undirected, and non-trivial graph. A set of vertice D of graph G = (V, E) is called Dominating Set if every vertex from is adjacent to a vertex . In this paper, we analyze the relation of domination number of corona product graphs and edge corona product graphs . The difference between corona product and edge corona product is located on the placement. If on corona product, copy of H graph is located at each vertex of graph G, while at edge corona product, copy of H graph is located on each edge of graph G. The difference in the number of vertices and edges between corona product and edge corona product is and . The result of this research is . There is a relation between all domination numbers that have been generated.