DOMINATION NUMBER OF DOUBLE GRAPH OF SOME GRAPHS

Abstract

A graph G consists of (V, E), indicates that V is its node set and E is its edge set. A subset D of vertices in a graph G is called a dominating set, then should each vertex in G be either included in D or is adjacent to at least one vertex in D. The minimum number of vertices required to form such a set is called the domination number of the graph, represented by γ(G). In this work, we computed the domination number of double graph of Queen’s graph, Lilly graph, Ladder graph, Ladder rung graph and Triangular belt graph.