期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2015
卷号：4
期号：12
页码：12346
DOI：10.15680/IJIRSET.2015.0412125
出版社：S&S Publications
摘要：For any graph G, let V(G) and E(G) denote the vertex set and edge set of G respectively. The Booleanfunction 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 anedge not incident to it in G. For brevity, this graph is denoted by B1(G). In this paper, edge domination number ofBoolean Function Graph B(G, L(G), NINC) of some standard graphs and its bounds are obtained.
关键词：Boolean Function graph; Edge Domination Number
