ON THE BOOLEAN FUNCTION GRAPH BP,L(G),INC,NINC OF A GRAPH

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(KP, L(G), INC, NINC) of G is a graph with vertex set V(G) ∪ E(G), and two vertices in B(KP, L(G), INC, NINC) are adjacent if and only if they correspond to two adjacent edges of G or to a vertex and aedge incident to it in G, or to a vertex and an edge not incident to it in G, where L(G) is the line graph of G. For brevity, this graph is denoted by BF3(G).