Volume :2 , Issue :1 ,Page :11-24

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 B(  K p , NINC, L(G)) of G is a graph with vertex set V(G)  E(G) and two vertices in B(  K p , NINC, L(G)) are adjacent if and only if they correspond to two adjacent edges of G or to a vertex and an edge not inci dent to it in G. For brevity, this graph is denoted by B 2 (G). In this paper, domination nu mber, independent, connected, tota l, cycle, point-set, restrained, split and non-split domination numbers in B 2 (G) are determined. Also the bounds for the above numbers are obtained.