Eccentricity properties of the Boolean graphs BG2(G) and BG3(G)

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


Volume :4 , Issue :2 ,Page : 32-42



Abstract :Let G be a simple (p, q) graph with vertex set V(G) and edge set E(G). B G, 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 two adjacent vertices of G, a vertex and an edge incide nt 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. B  Kp, INC,  L(G) (G) is a graph with vertex set V(G)  E(G) and two vertices are adjacent if an d 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 th is paper, eccentricity properties of BG 2 (G) and BG 3 (G) are studied.



  • Download PDF