A Brief Study On Different

Types Of Dominations
By
Monisha G
M17MA08
GUIDED BY
DR SUDHA
Introduction

In  graph theory domination is a fast growing area. The



dominating queen problem can be said to be the origin

of the study of dominating sets in graphs .
 Dominating Set:
In a graph G, D is a set of vertices if every vertex in V- D
is adjacent to some vertex in D is called Dominating set.
Types of Domination

  Total Domination Number:
A dominating set D is a total dominating set if the
induced subgraph has no isolated vertices.
 Paired Domination Number:
A dominating set D of a graph G is a paired
dominating set if the induced subgraph contains at
least one perfect matching.We note that (G) is an
even number.
 Connected Dominating Number:
A Connected dominating set D to be a dominating set
D whose induced subgraph is connected.
Connected Domination
Number:

  Example 1: Path
 D={,
5
Paired Domination number:

  Example 2: Cycle
 D={,
Total Domination Number:
  

 Example 3: Star graph

 D={
 For the star ,2
  
 Theorem 1: If G is a connected graph with p 3
vertices, then (G) (2p/3),and this bound is best
possible.
 Theorem 2: i) If G has P vertices and no isolates,
then (G)p-(G)+1,
 ii)If G is connected and <p-1, then (G)p-.

  Theorem 1: If G has no isolated vertices, then
2 and these bounds are sharp.
 Theorem 2: If G is a connected graph with p3,
then (G) p-1.
 Theorem 3: If a graph G has no isolated
vertices, then 2.
 


  The
following result is observed by
SampathKumar and Walikar.
 Theorem 1: If H is a connected spanning
subgraph of G, then (G) (H).
 Theorem 2: If G is a connected graph with p3
vertices, (G) = (G).
 Theorem 3: For any connected graph G,(G) =
(G).
  
Observation

:
 If G has no isolated vertices,then
 It is easy to see that (G) (G)2(G).
 For any connected graph G with , (G) (G).
Relationship
  between
  
 Relationship between
 
Observation:


The three parameters are equal

 For the graph ,= = = 2
 For the graph ,= = = 2.
 For the cycle ,= = = 4.
 For the complete bipatite graph ,= = = 2,m,n
≥ 2.

  For the double star = = = 2
 For the star ,= = = 2.
 For the Fan graph ,= = = 2.
 For the H-graph,= = = 2.
 For the Cross graph,= = = 2.
Changing and unchanging
Domination
parameters
 Hararyand Haynes surveyed the problems of
characterizing the graphs G in the following six
classes.
 LetG - v denote the graph formed by removing
vertex v and G - e denote the graph formed by
removing an edge e from G:
Terminology:

C : Represents changing
 U: Represents unchanging  
V : Vertex 
 E: Edge 
 R: Removal
A : Addition  

  (G - v) (G) for all vV (CVR)
 (G - e) (G) for all eE (CER)
 (G + e) (G) for all e E (CEA)
 (G - v) = (G) for all vV (UVR)
 (G - e) = (G) for all e E (UER)
 (G + e) = (G) for all eE(G) (UEA)
  
 It is useful to partition the vertices of G into three
sets according to how their removal affects their γ
(G). Let V = V0 U V+ U V - for
V 0
= {v V : (G - v) = (G)}
V +
= {v V : (G - v) > (G)}
V -
= {v V : (G - v) < (G)}
Similarly, the edge set can be partitioned into
 V0 = {uv E : (G - uv) = (G)}
 V- = {uv E : (G - uv) < (G)}
 V- = {uv E : (G +uv) < (G)}
V0 = {uv E : (G +uv) = (G)}
   vertices in V + were characterized by Bauer,
The


Harary, Nieminen and Suffel [1]

 Theorem : A vertex v ∈ V +
if and only if
(i) v is not an isolated vertex and is in every -set of
G, and
(ii) no subset S⊆ V – N (v) with cardinality (G)
dominates G-v. The vertices in V + were
characterized by Sampathkumar and Neeralagi.
 Theorem : If a graph G has a non isolated vertex
v such that the subgraph induced by N (v) is
complete, then (G - v) = (G).

  Theorem: For any tree T with n ≥ 2, there exists a
vertex v ∈ V, such that (T –v} = (T).
 Theorem: For any Complete bipartite graph with
m,n then (G –v} = (G).
 Theorem : A graph G has (G –e) = (G) + 1 for
any edge e ∈ E if and only if each component of G
is a star.
 Theorem : A graph G with (G) =1 is in CEA if and
only if G is complete.
Changing and unchanging on
different types of
domination
 
Example

1 Complete bipartite graph
Observation:
 For Graph m,n(UVR)
V 0 = {v E :}
 For Graph m,n (UER)
V 0 = {uv E :}

  Forthe complete bipatite graph , (G-) =
(G) = 2,m,n ≥ 2. (UVR)
V 0
= { V :(G-) = (G) }
 For the complete bipatite graph , (G-)
(G) = 2,m,n ≥ 2. (UVR)
 V 0 = { V :(G-) = (G) }
 For the complete bipatite graph , (G-)
(G) = 2,m,n ≥ 2. (UVR)
 V 0 = { V :(G-) = (G) }
  
Example

2 Complete Graph
Observation:
 For complete graph m,n(UVR)
V 0 = { V :}
 For complete graph m,n (UER)
V 0 = { E :}

  For the complete graph , (G-) = (G) = 2,n ≥ 3.
V 0
= { V :(G-) = (G) }
 For the complete graph , (G-) (G) = 2,n ≥ 3.
V 0 = { V :(G-) = (G) }
 For the complete graph , (G-) (G) = 2,n ≥ 3.
V 0 = { V :(G-) = (G) }
  

 For the Fan graph, (G - ) = (G) = 2 n 4

V0 = { E : (G - ) =(G)}
 For the Fan graph, (G - ) = (G) = 2 n 4
V0 = { E : (G - ) =(G)}
 For the Fan graph, (G - ) = (G) = 2 n 4
V0 = { E : (G - ) =(G)}
 
Example 5: Fan Graph
Observation:

 Case 1:For Fan Graph n(UVR) when

we remove outer vertex
V 0
= {v V :}
 Case 2:For Fan Graph n(CVR) when
we remove apex vertex
V +
= {v V :}

  Case
1:For Fan Graph n (UER) when we
remove path of the edge
V 0 = { E :=1}
 Case 2:For Fan Graph n (UER) when we
remove edge connecting path to apex vertex
V + = { E :}
 For Fan Graph n (UER)
V 0 = {E:
  

 For the Fan graph, (G+) = (G) = 2 n 4

V0 = { E : (G +) =(G)}
 For the Fan graph, (G+) = (G) = 2 n 4
V0 = { E : (G + ) =(G)}
 For the Fan graph, (G+) = (G) = 2 n 4
V0 = { E : (G + ) =(G)}

  Case
1:For Fan Graph, (G-) = (G) = 2,n ≥ 4. (UVR)
when we remove path vertex
V 0 = { V :(G-) = (G) }
 Case 2:For Fan Graph, (G-) > (G) n ≥ 4. (UVR)
when we remove apex vertex
V + = { V :(G-) >(G) }

  Case1:For Fan Graph, (G-) = (G) = 2,n ≥ 4.
(UVR) when we remove path vertex
V 0 = { V :(G-) = (G) }
 Case 2:For Fan Graph, (G-) > (G) n ≥ 4. (CVR)
when we remove apex vertex
V + = { V :(G-) >(G) }

  Case
1:For Fan Graph, (G-) = (G) = 2,n ≥ 4. (UVR)
when we remove path vertex
V 0
= { V :(G -) = (G) }
 Case 2:For Fan Graph, (G-) > (G) n ≥ 4. (CVR) when
we remove apex vertex
V +
= { V :(G-) >(G) }
 For Fan Graph, (G-) = (G) = 2,n ≥ 4. (UER)
V 0
= { E :(G-) = (G) }
  

 For Fan Graph, (G - ) = (G) = 2,n ≥ 4. (UER)

V 0 = { E :(G -) = (G) }
 For Fan Graph, (G -) = (G) = 2,n ≥ 4. (UER)
V 0 = { E :(G - ) = (G) }
 
Relationship between using Changing
and Unchanging concept
Vertex
   Removal:
For Connected Graph
Path Graph:
Observation:
 

For Path , ,
 =2

For Path

For Path ,
 
Cycle
Observation:
 

For Cycle ,

For Cycle

For Cycle
Conclusion
 Relationships among Classes:
There are many interesting
relationships among the six classes of changing and
unchanging graphs with domination parameters.
Reference
 B.D. Acharya, The strong domination number of a
graph and related concepts, J. Math.Phys. Sci., 14(5)
(1980), 471–475.
 S. Arumugam and R. Kala, Domsaturation number of
a graph, Indian J. pure appl. Math., 33(11)(2002),
1671 - 1676.
 S. Arumugam and M. Subramanian, Independence
saturation and extended domination chain in graphs,
AKCE J. Graphs. Combin., 4(2)(2007), 59–69.
 S. Arumugam and S. Ramachandran, Invitation
to Graph Theory, Scitech Publications, 2001.
 J.R.
Carrington, F. Harary and T.W. Haynes,
Changing and unchanging the domination
number of a graph, J. Combin. Math. Combin.
Comput., 9 (1991), 57–63.
 G. Chartrand and L. Lesniak, Graphs and
Digraphs, CRC, Fourth Edition (2005).
 E. J. Cockayne, R.M. Dawes and S. T. Hedetniemi,
Total domination in graphs, Networks, 10, 211–
219.
 T.W. Haynes, S. T. Hedetniemi and P. J. Slater,
Fundamentals of Domination in Graphs, Marcel
Dekker, Inc., New York, 1998.
 T.W. Haynes, S. T. Hedetniemi and P. J. Slater,
Domination in Graphs Advanced Topics, Marcel
Dekker, Inc., New York, 1998.
 T.W. Haynes and P.J. Slater, Paired domination
in graphs, Networks, 32 (1998), 199–206.
 E.Sampathkumar and H.B. Walikar, The
connected domination number of a graph, J.
Math. Phys. Sci., 13 (1979), 607–613.