IJSTE - International Journal of Science Technology & Engineering | Volume 2 | Issue 08 | February 2016

ISSN (online): 2349-784X

Independent Double Geodetic Domination

Number of a Graph
A. Nellai Murugan
Associate Professor
Department of Mathematics
V. O. Chidambaram College,Thoothukudi-628
008,Tamilnadu, India

A. Esakkimuthu
Research Scholar
Department of Mathematics
V. O. Chidambaram College,Thoothukudi-628
008,Tamilnadu, India

G. Mahadevan
Assistant Professor
Department of Mathematics
Gandhigram Rural Institute-Deemed University, Gandhigram Dindigul- 624 302

Abstract
A double geodetic dominating set S of G is said to be an independent double geodetic dominating set of G if the sub graph induced
by S is independent. The minimum cardinality among all independent double geodetic dominating sets of G is called the
independent double geodetic domination number of G. It is denoted by iDG (G). The independent double geodetic dominating set
of cardinality iDG (G) is called an iDG set of G. In this paper, we study independent double geodetic domination on graphs.
Keywords: Domination, Geodetic, Double Geodetic, Double Geodetic Dominating Set, Double Geodetic Domination
Number, Independent Double Geodetic Dominating Set, Independent Double Geodetic Domination Number
2000 Mathematical subject classification: 05C12, 05C69
________________________________________________________________________________________________________

I. INTRODUCTION
We consider finite graphs without loops and multiple edges. For any graph G the set of vertices is denoted by V(G) and the edge
set by E(G). We define the order of G by n = n(G) = |V(G)| and the size by m = m(G) = |E(G)|. For a vertexv V(G), the open
neighborhood N(v) is the set of all vertices adjacent to v, and N[v] = N(v){v} is the closed neighborhood of v. The degree d(v)
of a vertex v is defined by d(v) = |N(v)|. The minimum and maximum degrees of a graph G are denoted by = (G) and = (G),
respectively.
For X V(G)let G[X] the sub graph of G induced by X, N(X) = xX N(x) and N[X] =xX N(x). If G is a connected graph,
then the distance d(x, y) is the length of a shortest x y path in G. The diameter diam(G) of a connected graph is defined by
diam(G) = maxx,yV(G) d(x, y). An x y path of length d(x, y) is called an x y geodesic. A vertex v is said to lie on an x y
geodesic P if v is an internal vertex of P. The closed interval I[x, y] consists of x, y and all vertices lying on some x y geodesic

of G, while for S V(G), I[S] = x,yS

I[x, y]. If G is a connected graph, then a set S of vertices is a geodetic set if I[S] = V(G).
The minimum cardinality of a geodetic set is the geodetic number of G, and is denoted by g(G). The geodetic number of a
disconnected graph is the sum of the geodetic numbers of its components. A geodetic set of cardinality g(G) is called a g(G) set.
For references on geodetic sets see [1, 2, 3, 4, 6 ].
Let G be a connected graph with at least two vertices. A set S of vertices of G is called a double geodetic set of G if for
each pair of vertices x, y in G there exist vertices u, v S such that x, y I[u, v]. The double geodeticnumber dg(G) of G is the
minimum cardinality of a double geodetic set. Any double geodetic set of cardinality dg(G) is called dg(G)-set of G. [8]
A vertex in a graph dominates itself and its neighbors. A set of vertices S in a graph G is a dominating set if N[S] = V (G).
The domination number (G) of G is the minimum cardinality of a dominating set of G. The domination number was introduced
in [6].
Let G = (V, E) be any connected graph with at least two vertices. Adouble geodetic dominating set of G is a subset S of
V(G) which is both dominating and double geodetic set of G. A double geodetic dominating set S is said to be a minimal double
geodetic dominating set of G if no proper subset of S is a double geodetic dominating set of G. A double geodetic dominating set
S is a said to be a minimum double geodetic dominating set of G if there exists no double geodetic dominating set S 1 such that
|S | < |S|. The cardinality of a minimum double geodetic dominating set of G is called the double geodetic domination number of
G. It is denoted by DG (G). Any double geodetic dominating set S of G of cardinality DG is called a DG set of G.
It is easily seen that a dominating set is not in general a double geodetic set in a graph G. Also the converse is not valid in
general. This has motivated us to study the new domination conception of double geodetic domination. We investigate those
subsets of vertices of a graph that are both a double geodetic set and a dominating set. A double geodetic dominating set S of G is
said to be an independent double geodetic dominating set of G if the sub graphs of G induced by S is independent. We call these

All rights reserved by www.ijste.org

102

Independent Double Geodetic Domination Number of a Graph

(IJSTE/ Volume 2 / Issue 08 / 017)

sets independent double geodetic dominating sets. We call the minimum cardinality of anindependent double geodetic dominating
set of G, the independent double geodetic domination number of G.

II. INDEPENDENT DOUBLE GEODETIC DOMINATION NUMBER

Definition:
A double geodetic dominating set S of Gis said to be an independentdouble geodetic dominating set of G if the sub graph induced
by S is independent.
Example:
Consider the graph G in figure 1
3

Fig.
1:2.3
Graph G
Figure
{1 , 2 , 9 } is a minimum double geodetic dominating set of G and so () = 3. Further, {1 , 3 , 4 , 5 , 6 , 7 , 9 } is a minimum
independent double geodetic dominating set of G and hence () = 7.
Observation:
The following results are observed.
All graphs do not possess independent double geodetic dominating set.
For a complete graph on p vertices, the vertex set V(G) is the unique double geodetic dominating set. But it is not
independent and so a complete graph has no independent double geodetic dominating set.
If G contains at least two adjacent extreme vertices, then G has no independent double geodetic dominating set.
Problem:
Characterize graphs with independent double geodetic dominating set.
Let denote the collection of all graphs having at least one independent double geodetic dominating set.
Definition:
Let G . then, the minimum cardinality among all independent double geodetic dominating sets of G is called the independent
double geodetic domination number of G. It is denoted by iDG (G). An independent double geodetic dominating sets of cardinality
iDG (G)is called an iDG set of G.
Observation:
Let . The following are observed.
Every independent double geodetic dominating set is an independent double geodetic dominating set G. Therefore, 2
() () .
Every extreme vertex of G belongs to every independent double geodetic dominating set G.
Let S be the set of all extreme vertices of G. If it is an independent double geodetic dominating set of G, then S is the
unique minimum independent double geodetic dominating set of G by observation above.
If G contains a clique, then any independent double geodetic dominating set of G contains at most one vertex of the clique.
Therefore, If G contains a clique, then at most one vertex of the clique is an extreme vertex of G. For, considering the
graph in figure 2.8
Let K denoted the sub graph induced by {1 , 2 , 3 , 4 }. Then, 1 is the unique vertex of the clique K, belonging to any
double geodetic dominating set of G.

All rights reserved by www.ijste.org

103

Independent Double Geodetic Domination Number of a Graph

(IJSTE/ Volume 2 / Issue 08 / 017)

The vertex of the clique belonging to any independent double geodetic dominating set of G need not be an extreme vertex
of G. For example, considering the graph in figure 2.9, let K denote the sub graph induced by {1 , 2 , 3 , 4 }. Then, 1 is
the unique vertex of the clique K such that 1 belongs to the minimum double geodetic dominating set
{5 , 6 , 7 , , 10 , 1 } of G. But, it is not an extreme vertex of G.
10
1

Figure 2.9

Remark:
Let G be a connected graph and . Clearly, every independent double geodetic dominating set of G is an independent
dominating set of G. Therefore, the following are true:
iDG (G) i(G).
If S is a minimum independent double geodetic dominating set of G, then |V S| is a dominating set of G.
Theorem:
Let G be a connected graph with p vertices. Let . Then, () ().
Proof:
Let S be a minimum independent double geodetic dominating set of G. By Remark 3.7, () | |. Therefore, () ||
|| = (). Equivalently, () ().
Theorem:
Let and let S be an independent double geodetic dominating set of G. If () , then is a
. , () ().
Proof:
Let . S is independent and () imply that v is adjacent to at least k vertices of . Therefore, is a
and so () | | = || || (). Equivalently, () ().
Remark:
Let G be a connected graph with 3 vertices. Then, () 0 () = 0 ().
Theorem:
Let be a connected graphs with 3 vertices. Then, () = 2 if and only if () = 2.
Proof:
Suppose () = 2. Then, by Observation 3.6, 2 () () = 2. So, () = 2. Conversely, Suppose () = 2.
Let = {, } be a minimum double geodetic dominating set of G. Since 3, | | . Further, every double
geodetic contains at least one more vertex and (, ) 2. Then, {, } is an independent double geodetic dominating set of G
and () 2. By Observation 3.6, () = 2.
Theorem:
For 3, ( ) = ( )
Proof:
Let 3 and let = {1 , 2 , . }. If 0 ( 3) [or 1 ( 3)
or 2 ( 3), then =
{1 , 4 , , , 2 , } or = {1 , 4 , , , 3 , } or = {1 , 4 , , , 4 , 2 , } is a minimum double geodetic
dominating set of G. Also, S is independent. Therefore, ( ) ( ). Hence, by Observation 3.6, ( ) = ( ).
Theorem:
Let , 2. Then, (, ) = min{, }.
Proof:
Let U, W be the partition of V(K m,n ) with |U| = m and |W| = n. Let S be an independent double geodetic dominating set of K m,n .
Then, either S = U or S = W. For, if S is a proper subset of U( or W), then the vertices of U S ( or W S) are not adjacent to
any vertex of S. Therefore, iDG (K m,n ) = min{|U|, |W|} = min{m, n} ..
Theorem:
Let G be a connected graph on p vertices. Then, + and ( + ) = .
Proof:

All rights reserved by www.ijste.org

104

Independent Double Geodetic Domination Number of a Graph

(IJSTE/ Volume 2 / Issue 08 / 017)

Let () = { 1 , 2 , . . , } and 1 , 2 , . . , be the end vertices attached to 1 , 2 , . . , respectively in + . Then, =

{1 , 2 , . . , } is the only minimum independent double geodetic dominating set of + so ( + ) = .
Proposition:
For a star graph G, then () = 1.
Proof:
Let G = 1, with (1, ) = {, 1 }and (1, ) = { 1 }. Let S be a minimum independentdouble
geodetic dominating set of 1, . By Observation2.7{1 , 2 , 3 , . } . Since {1 , 2 , 3 , . } itself is a independent
double geodetic dominating set of 1, , S = {1 , 2 , 3 , . . , }. Therefore, (1, ) = = 1.
Proposition:
If G is a bi-star graph G, then () = 2.
Proof:
Let G = (, )where , 1. Suppose ((, )) = {, , , 1 1 }and((, )) = {, ,
1 1 }. Let S be a minimum independent double geodetic dominating set of (, ). By Observation
2.7.{1 , 2 , . , 1 , 2 , . } . Since {1 , 2 , . , 1 , 2 , . } is itself a independent double geodetic
dominating set of G, = { 1 , 2 , . , 1 , 2 , . }. Therefore, ((, )) = 2.
Theorem:

( ) = 2 . 2
6

Proof:
Let = {1 , 2 , 3 , . . , } n is even. Let be a minimum independent double geodetic dominating set of . We observe
that every independent double geodetic dominating set is a dominating set containing the vertices{1 , +1 } . Remaining
2

vertices satisfies the independent domination condition. Thus is aindependent double geodetic dominating set of and so

( ) = 2 .
6
Theorem:
Let G be any graph with k support vertices and end vertices. Then,
() .
Proof:
Let L and K denote the set of all end and support vertices of G respectively and|| = ; || = . Clearly, . By Observation
2.7, L is a subset of every independent double geodetic dominating set of G. So, () . Further every vertex of K lies in a
double geodesic joining two vertices of L as well as independent dominated by the vertices of L. Therefore, it is clear that
is a independent double geodetic dominating set of G and so () | | = || || = . Hence the proof.
Corollary:
Let T be any tree with k support vertices and end vertices such that + = . Then, () = .
The following example shows even if + < , () = .
Example:
Consider the graph G in figure 2.23(a)
11

12
5

4
1

10

Figure 2.23 (a)

Clearly, = {4 , 6 , 7 , , 9 , 10 , 11 , 12 } is a () = 8 = | |.
Remark:
In the above theorem, both the upper and lower bounds for ( ) are sharp.
For example, consider = , , are as in figures 2.24(a), 2.24(b) and 2.24(c) respectively.

G Figure 2.24 (a)

{1 , 4 , 6 , }is a independent double geodetic dominating set of .

4
Therefore, ( ) = + 2 = 2 + 2 = 4
3

All rights reserved by www.ijste.org

105

Independent Double Geodetic Domination Number of a Graph

(IJSTE/ Volume 2 / Issue 08 / 017)

Figure 2.24 (b)

{, 1 , 4 , 6 , }is a independent double geodetic dominating set of .

Therefore, ( ) = 5 = ( ) + 1.

Figure 2.24 (c)

{, 1 , 5 , }is a independent double geodetic dominating set of .

Therefore, ( ) = 4 = ( ).
Theorem:
If a vertex is joined by an edge to any vertex of , where = 3 + 1 1, then for the resulting graph =
2 , ( ) = ( ) + 1.
Proof:
a) Case 1:
Suppose is the graph obtained form by adding an edge to one of the end vertices of .
In this case, +1. Therefore,
(+1)4
3+24
32
4
33
( ) = (+1. ) =
+2 =
+2 =
+ 2 = + 2 and () = (. ) = + 2 =
+
3

2 = 1 + 2 = + 1.
Hence, ( ) = () + 1.
b) Case 2:
Suppose is obtained by adding an edge to one of the internal of .
In this case, the number of end vertices of is 3. Therefore, every minimum independent double geodetic dominating set of
contains these three end vertices. Clearly, any minimum independent dominating set of a path of 4 or 5 vertices along
4
with these three end vertices forms a minimum independent double geodetic dominating set of and so ( ) = 3 + =
3+

3+14
3

= 3 + 1 = + 2 = () + 1, as

when = 3 + 1.

REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]

F. Buckley, F. Harary, And L.V. Quintas,External Results on The Geodetic Number Of A Graph,Scientia 2a (1988), 17-26.
G. Chartrand, F. Harary, H. C. Swart And P. Zhang, Geodomination in Graphs, Bull. Ica 31 (2001), 51-59.
G. Chartrand, F. HararyAnd P. Zhang, Geodetic Sets in Graphs,DiscussionesMathematicae Graph Theory 20 (2000), 129-138.
G. Chartrand, F. HararyAnd P. Zhang, On The Geodetic Number of a Graph, Networks 39 (2002), 1-6.
F.Harry and M.Livingston, Caterpillars with equal domination and independent domination number, In V.R. Kulli, editor, Recent studies in graph theory,
VishwaInternat. Publ., Gulbara, India, (1989) 149-154.
T. W. Haynes, S. T. HedetniemiAnd P. J. Slater,Fundamentals Of Domination In Graphs, 208, Marcel Dekker, Inc, New York, 1998.
R. MunteanAnd P. Zhang,On Geodomination In Graphs, Congressus Numerantium 143 (2000), 161-174.
S. Robinson Chellathurai And S. Padma Vijaya, The Geodetic Domination Number For The Product Of Graphs, Transactions On Combinatorics, (2014
University Of Isfahan), Issn (On-Line): 2251-8665 Vol. 3 No. 4 (2014), Pp. 19-30.
A.P. Santhakumaran And T. Jebaraj, Double Geodetic Number of A Graph Discussiones Mathematicae, Graph Theory 32 (2012) 109119

All rights reserved by www.ijste.org

106