Open Access

## C. P. Sameerali and K. Sameena

#### Full Text

Let $G$ be a simple graph with vertex set $V$ and edge set $E$. Then $B_{G,INC, \overline{L}(G)}(G)$ is a graph with vertex set $V\cup E$ and two vertices are adjacent if and only if they correspond to adjacent vertices of $G$, a vertex and an edge incident to it in $G$ or two non-adjacent edges of $G$. We denote this graph by $BG_{2}(G)$, Boolean graph of $G$-second kind. In this paper, some properties of $BG_{2}(G)$ are studied.

Keywords:
Boolean Graph, Geodesic Set, Geodesic Number.