Domination numbers on the Boolean
function graph of a graph

Abstract: For any graph $G$, let $V(G)$ and $E(G)$ denote the vertex set and the edge set of $G$ respectively. The Boolean function graph $B(G, L(G), \NINC)$ of $G$ is a graph with vertex set $V(G)\cup 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 $B_{1}(G)$. In this paper, we determine domination number, independent, connected, total, cycle, point-set, restrained, split and non-split domination numbers of $B_{1}(G)$ and obtain bounds for the above numbers.

Keywords: domination number, point-set domination number, split domination number, Boolean function graph

Classification (MSC2000): 05C15

Full text of the article:

• Compressed PostScript file (152 kilobytes)
• PDF file (156 kilobytes)