• COMPLEMENTARY TREE DOMINATION IN BOOLEAN FUNCTION GRAPH B(Kp, INC,Kq) 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, INC,`Kq) of G is a graph with vertex set V(G)ÈE(G) and two vertices in B(Kp, INC,`Kq) are adjacent if and only if they correspond to two adjacent vertices of G, two nonadjacent vertices of G or to a vertex and an edge incident to it in G. For brevity, this graph is denoted by B4(G). In this paper, bounds of complementary tree domination number of Boolean function graph B4(G) are obtained and this number is found for Boolean function graphs of particular graphs. Also a characterization of graphs for which tree domination number is equal to 2 is obtained.
Keywords
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |