$P_4$-Decomposition in Boolean function graph of $B_3(G)$

Abstract

For any graph G, let V (G) and E(G) denote the vertex set and edge set of G respectively. The Boolean function graph B(K p, L(G), NINC) of G is a graph with vertex set V (G) ∪ E(G) and two vertices in B(K p, L(G), NINC) are adjacent if and only if they correspond to two non adjacent edges of G or to a vertex and an edge not incident to it in G. For brevity, this graph is denoted by B 3 (G). In this paper, P 4 -decomposition in Boolean Function Graph B(K p, L(G), NINC) of some standard graphs and corona graphs are obtained.