Volume :6 , Issue :3 ,Page : 62-73

Abstract :Let G be a simple (p, q) graph with vertex set V(G) and edge set E(G). B G, NINC,  Kq (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 not in cident to it in G. For simplicity, denote this graph by BG 1 (G), Boolean graph of G-first kind. In this pape r, connectivity and travers ability properties of BG 1 (G) and its complement are studied.