Complexity Issues for Variants of Secure

Domination in Block Graphs

Atul Patel
167553

Under the guidance of

Dr. P. Venkata Subba Reddy
Computer Science and Engineering
NIT-Warangal
Outline

e Motivation and Introduction

e Basic Notations and Terminology

e Definitions

e Problem Statement

e Literature Survey

e Conclusion and Future work

e References
Motivation and Introduction

e Identifying collecting nodes

e Deployment of security guards
e Backbone of wireless sensor networks
e Military strategy analysis
Motivation and Introduction

Identifying collecting nodes in network

Motivation and Introduction
Identifying collecting nodes in network
Motivation and Introduction
Identifying collecting nodes in network
Motivation and Introduction
Deployment of security guards
Motivation and Introduction
Deployment of security guards
Basic Notations and Terminology

e V (G )-Vertex set of the graph G

e E (G )-Edge set of the graph G
e γ(G )-Dominating number of the graph G
e γs (G )-Secure Domination number of the graph G
e γc (G )-Connected Domination number of the graph G
e γsc (G )-Secure Connected Domination number of the graph G
Dominating Set

Let G (V , E ) be a simple, undirected and connected graph. A subset

D of V (G )is Dominating Det (DS)in G if for every u ∈ V (G )\D,
there exists v ∈D such that( u, v ) ∈E (G).

e V(G)= {a, b, c, d, e, f }
e E(G)= {{f , a}, {a, b}, {b, d}, {d , e}{f , c}, {c, d} }
e D= {c, d}, {d , f }, {f , b, e}, {f , c, d, e}
Dominating Set1

Let G (V , E ) be a simple, undirected and connected graph. A subset

D of V (G )is Dominating Det (DS)in G if for every u ∈ V (G )\D,
there exists v ∈D such that( u, v ) ∈E (G).

e V(G)= {a, b, c, d, e, f }
e E(G)= {{f , a}, {a, b}, {b, d}, {d , e}{f , c}, {c, d} }
e D= {c, d}, {d , f }, {f , b, e}, {f , c, d, e}
Dominating Set (contd..)

Minimal Dominating set & Domination number

A dominating setDis Minimal Dominating Set if no other proper
subset D j ⊆ D is dominating set. The minimum cardinality of
domination of G is called domination number and is denoted by
γ(G ).

e D= {c, d}, {f , b, e}, {f , c, d, e}

e Domination Number of graph G γ(G ) = 2
Secure Dominating Set

A dominating set D ⊆ V (G )is said to be Secure Dominating Set

(SDS)in G if for every u ∈ V (G )\D, there exists v ∈ D such that
(u, v ) ∈ E (G )and( D\{v }) ∪{u} is dominating set. The minimum
cardinality of secure domination of G is called the secure domination
number and is denoted by γs (G ).

e D= {c, d}, {f , b, e}, {f , c, d, e}

e Secure Domination Number of graph G γs (G ) = 3
Connected Dominating Set

A dominating setDis said to be Connected Dominating Set (CDS)

in G , if the induced sub graph ofD, G [D]is connected. The min-
imum cardinality of connected dominating set of G is called the
connected domination number and is denoted by γc (G ).

e D= {c, d}, {f , b, e}, {f , c, d, e}

e Connected Domination Number of graph G γc (G ) = 2
Secure Connected Dominating Set
A connected dominating set(CDS) Dof G is said to be Secure
Connected Dominating Set (SCDS)in G , if for each u ∈ V (G )\D,
there exists v ∈ D such that( u, v ) ∈ E (G )and( D\{v }) ∪ {u} is
connected dominating set. The minimum cardinality of a secure
connected dominating set of G is called the secure connected dom-
ination number and is denoted by γsc (G ).

e D= {c, d}, {f , b, e}, {f , c, d, e}

e Secure Connected Domination Number of graph G γsc (G ) = 4
Unit Disk Graphs

Why study on Unit Disk Graphs is interesting?

Graphs are effective data structure to represent structured objects.
Many applications of science and engineering can be represented
with graphs.

e Social networks
e Pattern recognition
e Protein structures etc.

Most potential applications of unit disk graph arise in broadcast net-

works for analysis the frequency assignment and emergency sender
problem.
Unit Disk Graphs (contd..)

Unit disk graphsare the intersection graphs of equal sized circles in

the plane
Unit Disk Graphs (contd..)

Model of Unit disk graphs

e Intersection model

e Containment model
e Proximity model
Problem Statement

e The decision version of dominating set problem and secure dom-

inating set problem are known to be NP-complete in general
e Our goal is determining the computational complexity of secure
domination problem in Unit disk graphs
Problem Statement (Contd..)
The decision version of the secure dominating set problem in unit
disk graphs as demonstrated.
e Unit Disk Secure Dominating Set Problem(UD SDS)
Instance: Graph G = ( V , E )of ordernand a positive
integer k.
Question: Does G have a secure dominating set of cardi-
nality at most k?

The decision version of the secure connected dominating set problem

in unit disk graphs as demonstrated.
e Unit Disk Secure Connected Dominating Set Problem(UD
SCDS)
Instance: Graph G = ( V , E )of ordernand a positive
integer k.
Question: Does G have a secure connected dominating
set of cardinality at most k?
Literature Survey

Lemma
A planar graph G with maximum degree 4 can be embedded in the
plane using O( | V |) area in such that it vertices are at integer
coordinate and it edges are drawn so that they are made up of line
segments of the form x = i or y = j , for integer i and j
Literature Survey (Contd..)

Step 1 : The V (G ) are modeled by circles of radius 1/2 and E (G )

are replaced by chain of radius 1/2 circles i.e.,

C [ ei ] = {c i1, c i1 c , cik} iki

j jj j jj j jj
, c i1 , ci2, c i2
, c ,i2..., c , ik
i i
where ki depends on the length of the embedding of ei .
Literature Survey (Contd..)

Step 2 : The following two properties hold :

e Any proper 3-coloring of C [ei ] ∪{u, v} assigns u and v different
colors
e For all possible pairs (x , y ) of different colors from the set
{1, 2, 3}, there exists a proper 3-coloring of C [ei ]∪{u, v} which
assign u and v colors x and y respectively
Complexity of GRID GRAPHS

Theorem 1
GRID DOMINATING SET is NP-complete?
Step 1: By using above lemma embed G in the plane such that no
two parallel lines are closer than two units apart
Step 2: Length of edge u, v is of the form 3kuv +1 for some integer
kuv
Step 3: A grid graph G j is induced by above steps
Step 4: Dominating set D in G with | D |≤ k iff there exists a D’
in G j with | D j |≤ k
Complexity of m-CENTER ON POINTS

Theorem 2
The EUCLIDIAN m-CENTER ON POINTS is NP-complete?
Step 1: construction
e The coordinates of each node are (3i , 3j ) for some integers i
and j
e All the edges are drawn on the lines x = 3i or y = 3j for some
integers i or j . An edge may be represented by a series of
consecutive line segments which may make turns at some
positions of the form (3i j,3j j)
e All the lines representing edges do not intersect each other
Complexity of m-CENTER ON POINT (Contd..)

Step 2: for each edge

e length equal to 3

e length greater than 3

Total length of the edges of G imbedded as above is 3L.

Complexity of m-CENTER ON POINT (Contd..)

Step 3: let I = [p1, p2] be series of line segment on plane P which

represent an edge in G . If | I |= 3τ , where | I | denotes the length
of I , τ circles on the I are chosen so that following conditions are
satisfied
e If p1 ∈ D and p2 ∈ D, the chosen τ circles cover all the joint
point on I not covered by the circles with center on p1 or p2
e If p1 ∈ D and p2 ∈/ D (the case of p2 ∈ D and p1 ∈/ D is
similar) the chosen τ circles cover the node point p2 as well as
all the joint points on I not covered by the circle with center
on p1
e If p1 ∈/D and p2 ∈/ D, the chosen τ circles cover all the joint
points on I (but cover neither p1 nor p2 )
By using above conditions circles cover all the points on the plan P.
Complexity of m-CENTER ON POINT (Contd..)
Conclusion and Future work

e The main objective of the work is to study the complexity of

dominating set and secure dominating set related parameters
when restricted to unit disk graphs. Since unit disk domination
(UD DOM) problem and unit disk connected domination (UD
CDOM) problem are NP-complete .
e My future work includes investigating whether the problem of
secure domination and secure connected domination remains
NP-complete when restricted to unit disk graphs, if not then I
will try to provide polynomial time algorithms.
ReferenceI
Reference ll

E.J.Cockayne, P.J.P.Grobler, W.R.Grundlingh, J.Munganga,

J.H.van Vuuren, ”Protection of a graph”, Util.Math. 67(2005)
19-32.
M.R.Garey, D.S.Johnson, ”Computers and Intractability: A
Guide to the Theory of NP-Completeness”, Freeman, New York,
1979.
R.M. Karp, Reucibility among Combinatorial Problems, In Com-
plexity of Computer Combinatorial Problems, R.E. Miller and
J.W. Thatcher, Plemum Press, New York, 1972.
W. Klostermeyer and C.M. Mynhardt, Secure Domination and
Secure Total Domination in Graphs, Discussiones Mathematicae
Graph Theory, 28(2), 267-282, 2008.
Thank You !