Domination numbers on the complement of the Boolean function graph of a graph
T. N. Janakiraman, S. Muthammai, M. Bhanumathi (2005)
Mathematica Bohemica
Similarity:
For any graph , let and denote the vertex set and the edge set of respectively. The Boolean function graph of is a graph with vertex set and two vertices in are adjacent if and only if they correspond to two adjacent vertices of , two adjacent edges of or to a vertex and an edge not incident to it in . For brevity, this graph is denoted by . In this paper, we determine domination number, independent, connected, total, point-set, restrained, split and non-split domination...