Edge domination in Boolean function graph B(L(G), 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(, L(G), NINC) of G is a graph with vertex set V(G) ∪ E(G) and two vertices in B(, L(G), NINC) are adjacent if and only if they correspond to two adjacent edges of G or to a vertex and an edge not incident to it in G. For brevity, this graph is denoted by B2(G). In this paper, Edge domination numbers of Boolean Function Graph B(, L(G), NINC) of some standard graphs and corona graphs are obtained.