**InternationaleJournals**

**A Note on domination numbers of grid graphs**

**D. Reddy Babu ^{1}
and L. N. Varma P^{2}**

^{1}Department
of FED-1, K.L.University,
Vaddesswaram 522502, Guntur, India. Mobil
No:9441752543, Email: reddybabu17@gmail.com

^{2}Department
of S&H, Vignan
University, Vadlamudi 522 231, Guntur, India.Mobil
No:9490606025, plnvarma@gmail.com

**ABSTRACT **

In this paper we deal with the
domination numbers γ(P_{k} X P_{n}) for the
complete grid graphs P_{k} X P_{n }for ^{k=14 }and . These numbers were previously established for and (see [3], [4]).
There is no 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*.

**Key words**: Dominating set, Domination number,
Transformation of a dominating set,

**2000 Mathematics Subject Classification:** 05C69

**International
eJournal of Mathematical Sciences, Technology and Humanities**

**Volume** 2,
**Issue** 1, **Pages**: 221 - 230