• S.DHANALAKSHMI
• S.MUTHAMMAI

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(G, L(G), NINC) of G is a graph with vertex set V(G)  E(G) and two vertices in B(G, L(G), NINC) are adjacent if and only if they correspond to two adjacent vertices of G, 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 B1(G). In this paper, Domatic edge domination numbers of Boolean Function Graphs of some standard graphs are obtained.

Boolean Function graph, Edge Domination Number

"DOMATIC EDGE DOMINATION IN BOOLEAN FUNCTION GRAPH B(G, L(G), NINC) OF A GRAPH", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 3, page no.1019-1021, March-2018, Available :http://www.jetir.org/papers/JETIR1803193.pdf

"DOMATIC EDGE DOMINATION IN BOOLEAN FUNCTION GRAPH B(G, L(G), NINC) OF A GRAPH", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 3, page no. pp1019-1021, March-2018, Available at : http://www.jetir.org/papers/JETIR1803193.pdf