Volume :6 , Issue :2 ,Page :28-40

Abstract :For any graph G , let V(G) and E(G) denote the vertex set and edge set of G respectively. The Boolean function graph ) K , INC , K ( B q p of G is a graph with vertex set () () VG EG  and two vertices in ) K , INC , K ( B q p are adjacent if and only if they co rrespond to two adjac ent vertices of G , two nonadjacent vertices of G or to a vertex and an edge incident to it in G , For brevity, this graph is denoted by ) G ( B 4 In this paper, various domination numbers of ) G ( B 4 are determined.