Perfect, Split and Non-split domination of the Boolean graph BG2(G) and its complement

T.N.Janakiraman, M.Bhanumathi, S.Muthammai


Volume :5 , Issue :2 ,Page :37-48



Abstract :Let G be a simple (p, q) graph with vert ex set V(G) and edge set E(G). BG, INC,  L(G) is a graph with vertex set V(G)  E(G) and two vertices are adjacent if and only if they correspond to two adjacent vertices of G or to a vertex and an edge incident to it in G or two non-adjacent edges of G. For simplicity, denote this graph by BG 2 (G), Boolean graph of G-second kind. In this paper, perfect domination, Split and No n-Split domination of BG 2 (G) and its complement are studied.



  • Download PDF