Global domination and neighborhood numbers in Boolean function graph of a graph

T. N. Janakiraman; S. Muthammai; M. Bhanumathi

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Global domination and neighborhood numbers in Boolean function graph of a graph”

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 $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), N I N C)$ of $G$ is a graph with vertex set $V (G) \cup E (G)$ and two vertices in $B (G, L (G), N I N C)$ 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, point-set, restrained, split and non-split domination...

Domination numbers on the Boolean function graph of a graph

T. N. Janakiraman, S. Muthammai, M. Bhanumathi (2005)

Mathematica Bohemica

Similarity:

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), N I N C)$ of $G$ is a graph with vertex set $V (G) \cup E (G)$ and two vertices in $B (G, L (G), N I N C)$ 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...