On the Domination Numbers of Certain Prism Graphs

A dominating set S of a graph , is a subset of  the vertex set V (G) such that any vertex not in S is adjacent to at least one vertex in S .The domination number of a graph G  denoted by  is the minimum size of the dominating sets of G. In this paper we introduced the domination numbers of certain prism graphs.