Integrated Intelligent Research (IIR) International Journal of Computing Algorithm

Volume: 03 Issue: 03 December 2014 Pages: 240-242

ISSN: 2278-2397

Exact Double Domination in Graph

L.JethruthEmelda Mary 1, S.Kalaiselvi2
PG and Research Department of Mathematics
1,2

St.Joseph’s Arts & Science College(Autonomous),Cuddalore,India.

E-mail:[email protected], [email protected]

Abstract- In this paper, we deals about exact double The double domination number γ 2(G) is the minimum
domination in graphs. In a graph a vertex is said to dominate cardinality of a doubly domination set of G.
itself and all its neighbours. A double dominating set is exact if D. Exact double domination
every vertex of G is dominated exactly twice. If a double In a graph G =(V,E),a subset S ⊆V is a double dominating set
dominating set exist then all such sets have the same size and of G.If for vertex
bounds on this size. We established a necessary and sufficient v either vis in S and has atleast one neighbour in S (or) v is
condition of exact double dominating set in a connected cubic
graph with application. in V-S and has atleast two neighbours in S is called exact
double domination.
Keywords - Double domination, exact double domination,
connected cubic graph. III.GRAPHS WITH EXACT DOUBLE DOMINATING
SETS
I. INTRODUCTION Result:1

In a graph G=(V,E),a subset S ⊆V is a dominating set of G if γ2(cn)=

every vertex v of V−S has a neighbour in S.The domination
number γ(G) is the minimum cardinality of a dominating set of Solution:
G.Harary and Haynes defined and studied the concept of Let γ2-double domination number
double domination, which generalizes domination in graphs.In n-number of vertices
a graph G =(V,E), a subset S of V is a doubly domination set upper integral part
of G if every vertex v ∈V,either v is in S and has atleast one
neighbour in S or v is in V−S and has atleast two neighbours in Cn -cycle of order n
S.The double domination number γ 2(G) is the minimum If n=3, then S1 = {a,b}
cardinality of a doubly dominating set of G. Double Clearly,S1 is a minimum doubly dominating set of G.
domination was also studied in [2,3,4].
γ2(c3)= =2
Harary and Haynes defined an sufficient condition for doubly
dominating set as a subset S of V such that each vertex of V is
dominated by exactly two vertices of S.We will prefer here to
use the phrase exact doubly dominating set. Every graph G =
(V,E) with no isolated vertex has a doubly dominating set,if a
graph G admits an exact doubly dominating set then all such
sets have the same size and we give some bound on this
number.Finally, we construct the characterization of those trees
that admit an exact doubly dominating set and we establish a
necessary and sufficient condition for the existence of an exact For n = 4,we have S2={a,c,d}
doubly dominating set in a connected cubic graph.We denote
respectively by n, δ and ∆ the order (number of vertices),
minimum degree and maximum degree of a graph G.

II. DEFINITIONS

A. Dominating set
A set S of vertices of G is a dominating set of G if every vertex
of G is dominated by atleast one vertex of S.
Clearly, S2 is a minimum double dominating set of G
B. Domination number
The minimum cardinality among the dominating sets vertex of γ2(c4) = = = =
G is called the dominating number of G and is denoted by
γ(G).
For n=5,we get S3={a,b,e,d,}
C. Double domination number

240
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03 Issue: 03 December 2014 Pages: 240-242
ISSN: 2278-2397

2 – double domination number

Example:1
If G is complete, then
γ2 (G) = n-S+1

S3 is a minimum double dominating set of G

γ2(p5) = 2 =2 =2 2=4

When n = 6 ,S4 = {a,b,c,e,f}

Consider G = K5 graph,
In a complete graph γ2(G)=2,and n=5,s=4
n-S+1=5-4+1=2
γ2(G) = n-S+1
Suppose G is a tree
S4 is a minimum double dominating set of G (ie) G is a acylic connected graph
For G is a Star graph then
γ2(G) = n– S +1
γ2(c6)= = =4

In General, γ2(cn)=

3.1 Exact doubly domination sets:

Theorem:1
If G has an exact doubly dominating set then all such sets have
the same size. n=7, S =1
ie) n-S+1=7.
Proof: Let D1,D2 be two exact doubly dominating sets of G. Let
I =D1∩D2, and let X0 and X1 be the subsets of D1−I such that Result:2
every vertex of X0 has zero neighbours in I and every vertex of
If G is a path then
X1 has one neighbour in I.

Clearly D1 − I = X0∪ X1.

We define a subsets Y0 and Y1 of D2 −I. γ2(Pn) =

We claim that |X1| = |Y1|.

let x be any vertex of X1,adjacent to a vertex z∈I.Since D2 is an and hence γ2(Pn) < n-S+1
exact doubly dominating set, z has a unique neighbour y in
D2.We have y ∈ D2 −I, for otherwise z has two neighbours x,y Theorm:3
in D2,which is a contradiction.Thus y∈Y1.The symmetric
argument holds for every vertex of Y1, and so |X1| = |Y1|.Since Let G be a connected cubic graph, then G has an exact doubly
D2 is an exact doubly dominating set, every vertex of X 1 has dominating set if and only if G has a perfect matching M such
exactly one neighbour in Y0∪Y1 and every vertex of X0 has that associated graph GM is an equitable bipartite graph.
exactly two neighbours in Y0∪Y1.The vertices of Y1 and Y0.
This implies Proof :-

|X0| = |Y0|, thus |D1=|D2|. Let G be a connected cubic graph with an exact doubly
dominating set S.
The size of an exact doubly dominating set with the order and
minimum degree δ of a graph G.

Theorem: 2
Every graph G without isolated vertices satisfies,
γ2 (G) = n – S +1
where
n– Number of vertices
S – Minimum degree
241
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03 Issue: 03 December 2014 Pages: 240-242
ISSN: 2278-2397

S={a,b,g,h}
So s induces a 1-regular graph
1-regular means every vertex has degree1. whose edge form a
matching M1
and every vertex of S has two neighbours in V-S

GM= (S,V-S; E-M)

So, | S | = |V-S|, and so |M1|=|M2|

Thus, the graph GM associated with M is an equitable bipartite

M1 with equitable bipartition (M1,M2).

Since every vertex of V-S has exactly two neighbours in Conversely,

S,thesubgraph induced by V-S is 1-Regular and its forms a
matching M2. Let M be a perfect matching of a connected cubic graph G such
that the associated graph.Gm is equitable bipartite, with
equitable bipartition (A,B).Let Am(resp.Bm) be the vertices of G
that are contained in the edges corresponding to the vertices of
A(resp. B).
Consequently, Am and Bm are two disjoint applied of critical
exact doubly dominating sets of G.

IV.APPLICATION OF DOUBLE DOMINATION

v-s={d,c,f,e} CRITICAL TREES AND CYCLES

Often when it is difficult to characterize graphs with particular

parameters, it ishelpful to restrict one’s attention to trees.It has
been found that no tree is dominationor total domination edge
critical.

First we must define a star and double star. A star is a tree with
exactly one vertex that is not a leaf.
Where γ2(K1,6) =7 while γ2(K1,6+e)=6 for any edge e∉ E(K1,6).
M2 In general,for the star K1,m, where γ2(K1,m) = m + 1, then
Thus G admits a perfect matching γ2(K1,m + e) = m+1 for any edge
M=M1 M2 e E(K1,m). A double star is a tree with exactly two vertices
that are not leaves in figure 2 .Using this information we
characterize the double domination edge critical trees.

Proposition :1
A tree T is double domination edge critical if and only if T is a
star or a double star.

Proposition :2
Let G′ = G +uv for any uv E(G) and again the darkened
M1={e1=ab, e4=gh}
vertices represent a double dominating set. Note that any edge
M2={e2=dc,e3=fe}
added will decrease γ2(G) by one.
Each edge of E-M joins a vertex of S with a vertex of V-S, and
the bipartite subgraph is 2- regular.
[ M ={e1, e4, e2, e3}
E-M = {e1, e2, …… e12} – {e1, e4,e2,e3}
={e5,e6,e7……….. e12} ]

Let G be a star graph of order 7.

γ2(G)=7
When an edge is added to the star graph, we have γ2(G+uv)=6.
242
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03 Issue: 03 December 2014 Pages: 240-242
ISSN: 2278-2397

V.CONCLUSION

We discussed double domination, exact double domination and

connected cubic double domination of graph and we
established the necessary and sufficient condition of the
existence of connected cubic double domination of graph with
different parameters and also we verified that γ 2(G) will
decrease by one when any edge is added .

REFERENCES
[1] M.Blidia, M.Chellai, T.W. Hayes and M.Henning, Independent and
double domination in trees, to appear in UtilitasMathematica.
[2] M. Blidia, M. Chellali and T.W. Haynes, Characterizations of trees with
equal paired and double domination numbers, submitted for publication.
[3] M.Faber, Domination, independent domination and duality in strongly
chordalgraphs, Discrete Appl. Math 7. (1984) 115-130.
[4] F.Harary and T.W.Haynes, Double domination in graphs, ArsCombis.
55 (2000) 201-213.
[5] T.W.Haynes, S.T. Hedetniemi and P.J.Slater, Domination in Graphs:
Advanced Topics (Marcel Dekker, New york, 1998).

243