Boolean graph BG3(G) of a graph G

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


Volume :3 , Issue :4 ,Page :191-206



Abstract :Let G be a simple (p, q) graph with vertex set V(G) and edge set E(G). B  Kp, INC,  L(G)( G) is a graph with vertex set V(G)  E(G) and two vertices are adjacent if and only if they correspond 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 3 (G), Boolean graph of G-third kind. In this paper, some properties of BG 3 (G) are studied.



  • Download PDF