• DOMINATION NUMBERS OF GRID GRAPHS P15×Pn

Abstract

In this paper we deal with the domination numbers of the complete grid graphs P_k 〖×P〗_n for k=15 and . Establishing this numbers for various class of graphs is the content of many papers in literature. Some of the papers which deal with the dominating number of grid graphs are [3], [4], [5]. There is no general formula for the domination number of a graph. In this paper, we use the concept of transforming the domination from a vertex in a dominating set D of a graph G = (V, E) to a vertex in V – D, where G is a simple connected graph. We give an algorithm using this transformation to obtain a domination set of a graph G.