Neighborhood Connected

Domination in Some Operation of

Graph

Bacus, Rjyll A.
Presenter

Department of Mathematics and Statistics

College of Science and Mathematics
Mindanao State University - Iligan Institute of Technology
Andres Bonifacio Avenue, Tibanga, 9200 Iligan City

RaBacus NCD
 Neighborhood Connected
Domination in Some Operation of
Graph

Bacus, Rjyll A.
Presenter

Department of Mathematics and Statistics

College of Science and Mathematics
Mindanao State University - Iligan Institute of Technology
Andres Bonifacio Avenue, Tibanga, 9200 Iligan City

RaBacus NCD
Introduction

1 Sampathkumar and Walikar, introduced the concept of

connected domination number of a graphs 1979

RaBacus NCD
Introduction

1 Sampathkumar and Walikar, introduced the concept of

connected domination number of a graphs 1979
2 Dalam further studies Domination in Graphs 2008

RaBacus NCD
Introduction

1 Sampathkumar and Walikar, introduced the concept of

connected domination number of a graphs 1979
2 Dalam further studies Domination in Graphs 2008
3 Go introduced Some Types of Dominating Sets and
Domination Numbers in Graphs 2011

RaBacus NCD
Introduction

1 Sampathkumar and Walikar, introduced the concept of

connected domination number of a graphs 1979
2 Dalam further studies Domination in Graphs 2008
3 Go introduced Some Types of Dominating Sets and
Domination Numbers in Graphs 2011
4 Arumugam and Sivagnanam, introduced the concept of
Neighborhood connected domination in graphs 2010

RaBacus NCD
Significance of the Study

The theory of domination has a wide range of topics to

study. This study will provide better understanding more
on the neighborhood connected domination. This could be
of great help in establishing relation in neighborhood
connected domination numbers with other domination
parameter.

RaBacus NCD
Preliminaries
Dominating set
A vertex v in a graph G is said to dominate itself and each
of its neighbors, that is, v dominates the vertices in its
closed neighborhood N [v]. A set D ⊆ V is called a
dominating set if every vertex in V \ D is adjacent to some
vertex of D. Notice that D is a dominating set if and only
if N [D] = V . Otherwise, we say D is a nondominating set
of G. The domination number of G, denoted by γ(G), is
the cardinality of a smallest dominating set of G. We call a
smallest dominating set a γ − set.

RaBacus NCD
Preliminaries
Dominating set
A vertex v in a graph G is said to dominate itself and each
of its neighbors, that is, v dominates the vertices in its
closed neighborhood N [v]. A set D ⊆ V is called a
dominating set if every vertex in V \ D is adjacent to some
vertex of D. Notice that D is a dominating set if and only
if N [D] = V . Otherwise, we say D is a nondominating set
of G. The domination number of G, denoted by γ(G), is
the cardinality of a smallest dominating set of G. We call a
smallest dominating set a γ − set.

Remark
Let u, v ∈ V (G), with u 6= v. If u ∈ N [v], then uv ∈ E(G).
Also, N [v] ⊆ V (G) for any v ∈ V (G).

RaBacus NCD
Neighborhood connected dominating set
A dominating set S of a connected graph G is called a
neighborhood connected dominating set (ncd-set) if the
induced subgraph hN (S)i is connected. The minimum
cardinality of a ncd-set of G is called neighborhood
connected domination number of G is denoted by γnc (G).
We refer to a minimum ncd-set of G a γnc -set

RaBacus NCD
Neighborhood connected dominating set
A dominating set S of a connected graph G is called a
neighborhood connected dominating set (ncd-set) if the
induced subgraph hN (S)i is connected. The minimum
cardinality of a ncd-set of G is called neighborhood
connected domination number of G is denoted by γnc (G).
We refer to a minimum ncd-set of G a γnc -set

Spanning Subgraph
It is a spanning subgraph if it contains all the vertices of G.
The induced subgraph hSi is the maximal subgraph with
vertex set S.

RaBacus NCD
Operation of Graphs
Join of two graphs
The join of graphs G and H, denoted by G + H, is a graph
whose vertex set V (G) ∪ V (H), and whose edge set
E(G) ∪ E(H) ∪ {v1 , v2 : v1 ∈ V (G), v2 ∈ V (H)}

RaBacus NCD
Operation of Graphs
Join of two graphs
The join of graphs G and H, denoted by G + H, is a graph
whose vertex set V (G) ∪ V (H), and whose edge set
E(G) ∪ E(H) ∪ {v1 , v2 : v1 ∈ V (G), v2 ∈ V (H)}

Corona of two graphs

The corona G ◦ H of two graphs G and H is the graph
obtained by taking one copy of G of order n and n copies of
H, and then joining the ith vertex of G to every vertex in
the ith copy of H. For every v ∈ V (G), denoted by H v the
copy of H whose vertices are attached one by one to the
vertex v. Subsequently, denoted by v + H v the subgraph of
the corona G ◦ H corresponding to the join of vertex of H v
for v ∈ V (G)

RaBacus NCD
Lexicographic Product
The Lexicographic Product G[H] of the graphs G and H
has the vertex set V (G[H]) = V (G) × V (H) and two
distinct vertices (u, v) and (x, y) are adjacent if:

RaBacus NCD
Lexicographic Product
The Lexicographic Product G[H] of the graphs G and H
has the vertex set V (G[H]) = V (G) × V (H) and two
distinct vertices (u, v) and (x, y) are adjacent if:
ux ∈ E(G)

RaBacus NCD
Lexicographic Product
The Lexicographic Product G[H] of the graphs G and H
has the vertex set V (G[H]) = V (G) × V (H) and two
distinct vertices (u, v) and (x, y) are adjacent if:
ux ∈ E(G)
u = x and vy ∈ E(H).

RaBacus NCD
Related Literature

Go’s Theorem
Let G and H be connected graphs. Then C ⊆ V (G + H) is
a dominating set in G + H if and only if at least one of the
following is true;

RaBacus NCD
Related Literature

Go’s Theorem
Let G and H be connected graphs. Then C ⊆ V (G + H) is
a dominating set in G + H if and only if at least one of the
following is true;
C ∩ V (G) is a dominating set in G

RaBacus NCD
Related Literature

Go’s Theorem
Let G and H be connected graphs. Then C ⊆ V (G + H) is
a dominating set in G + H if and only if at least one of the
following is true;
C ∩ V (G) is a dominating set in G
C ∩ V (H) is a dominating set in H

RaBacus NCD
Related Literature

Go’s Theorem
Let G and H be connected graphs. Then C ⊆ V (G + H) is
a dominating set in G + H if and only if at least one of the
following is true;
C ∩ V (G) is a dominating set in G
C ∩ V (H) is a dominating set in H
C ∩ V (G) 6= ∅ and C ∩ V (H) 6= ∅

RaBacus NCD
Result

Theorem
Let G and H be connected graphs. Then C ⊂ V (G + H) is
a neighborhood connected dominating set in G + H if and
only if C is a dominating in G + H

RaBacus NCD
Result

Theorem
Let G and H be connected graphs. Then C ⊂ V (G + H) is
a neighborhood connected dominating set in G + H if and
only if C is a dominating in G + H

Theorem
Let G be any connected graph and H be any graph. If
C ⊆ V (G + H) contains a vertex a ∈ V (G) and a vertex
b ∈ V (H), then C is a neighborhood connected dominating
set of G + H

RaBacus NCD
Result

Theorem
Let G and H be connected graphs. Then C ⊂ V (G + H) is
a neighborhood connected dominating set in G + H if and
only if C is a dominating in G + H

Theorem
Let G be any connected graph and H be any graph. If
C ⊆ V (G + H) contains a vertex a ∈ V (G) and a vertex
b ∈ V (H), then C is a neighborhood connected dominating
set of G + H

Remark
Theorem above holds if H is disconnected.

RaBacus NCD
Theorem
Let G be a nontrivial connected graph and H be any
graph. A subset C of V (G ◦ H) is a neighborhood
connected dominating set of G ◦ H if and only if
C = A ∪ (∪v∈A Sv ) ∪ (∪u∈V (G)\A Du ) where A ⊆ V (G) and
the following holds.

RaBacus NCD
Theorem
Let G be a nontrivial connected graph and H be any
graph. A subset C of V (G ◦ H) is a neighborhood
connected dominating set of G ◦ H if and only if
C = A ∪ (∪v∈A Sv ) ∪ (∪u∈V (G)\A Du ) where A ⊆ V (G) and
the following holds.
For each v ∈ A, Sv ⊆ V (H v ) where Sv 6= ∅ whenever
v∈/ NG (A)

RaBacus NCD
Theorem
Let G be a nontrivial connected graph and H be any
graph. A subset C of V (G ◦ H) is a neighborhood
connected dominating set of G ◦ H if and only if
C = A ∪ (∪v∈A Sv ) ∪ (∪u∈V (G)\A Du ) where A ⊆ V (G) and
the following holds.
For each v ∈ A, Sv ⊆ V (H v ) where Sv 6= ∅ whenever
v∈/ NG (A)
For each v ∈ V (G) \ A, Du is a dominating set of
u + Hv

RaBacus NCD
Lemma
Let G and H be a connected graphs and A ⊆ V (G) and
B ⊆ V (H). Then D = A × B is a dominating set in G[H] if
and only if A is a dominating set of G.

RaBacus NCD
Lemma
Let G and H be a connected graphs and A ⊆ V (G) and
B ⊆ V (H). Then D = A × B is a dominating set in G[H] if
and only if A is a dominating set of G.

Theorem
Let G and H be a connected graphs, and A ⊆ V (G) and
B ⊆ V (H). Then D = A × B is a neighborhood connected
dominating set in G[H] if and only if A is a neighborhood
connected dominating set.

RaBacus NCD
Every neighborhood connected dominating set of a
connected graph G is a dominating set. Hence, this result
is immediate from observation.

RaBacus NCD
Every neighborhood connected dominating set of a
connected graph G is a dominating set. Hence, this result
is immediate from observation.
Theorem
Given any positive integers a and b, with a ≤ b, there exists
a connected graph G with γ(G) = a and γnc (G) = b

RaBacus NCD
References I
Arumugam S., Sivagnanam C. Neighborhood connected
domination in graphs, J. Combin. Math. Combin.
Compute. 73 (2010), 55-64.
Arumugam S., and Sivagnanam C. Neighborhood Total
Domination in Graphs, Opuscula Mathematics, 31 4,
2011.
Amos D. and Dele Via E. On Domination in Graphs,
University of Houstoun-Downtown. 2012.
Dalam, J On Domination in Graphs, Undergraduate
Thesis. MSU-IIT, March 2008.
Go, C.E.Some types of Dominating Sets and
Domination Numbers in Graphs.Doctoral Dissertation,
MSU-IIT, April(2011)
RaBacus NCD
References II

Paulraj J. and Arumugam S. Domination and

Connectivity in graphs. International Journal of
Management and Systems 8 (1992) 3, 233-236.
Sampathkumar E., Walikar H.B. The connected
domination number of a graph, J. Math. Phys. Sci. 13
(1979), 607-613
Wesstein, E.W., Simple Graphs,
http://mathworld.wolfram.com, 2011.

RaBacus NCD