Algorithmic Aspects of Secure Connected Domination in Graphs

01/30/2020
by   Jakkepalli Pavan Kumar, et al.
0

Let G = (V,E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V∖ S, there exists v∈ S such that (u,v) ∈ E and the set (S ∖{ v }) ∪{ u } is a connected dominating set of G. The minimum size of a secure connected dominating set of G denoted by γ_sc (G), is called the secure connected domination number of G. Given a graph G and a positive integer k, the Secure Connected Domination (SCDM) problem is to check whether G has a secure connected dominating set of size at most k. In this paper, we prove that the SCDM problem is NP-complete for doubly chordal graphs, a subclass of chordal graphs. We investigate the complexity of this problem for some subclasses of bipartite graphs namely, star convex bipartite, comb convex bipartite, chordal bipartite and chain graphs. The Minimum Secure Connected Dominating Set (MSCDS) problem is to find a secure connected dominating set of minimum size in the input graph. We propose a (Δ(G)+1) - approximation algorithm for MSCDS, where Δ(G) is the maximum degree of the input graph G and prove that MSCDS cannot be approximated within (1 -ϵ) ln(| V |) for any ϵ > 0 unless NP ⊆ DTIME(| V |^O(log log | V |)) even for bipartite graphs. Finally, we show that the MSCDS is APX-complete for graphs with Δ(G)=4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2020

Algorithmic Aspects of 2-Secure Domination in Graphs

Let G(V,E) be a simple, undirected and connected graph. A dominating set...
research
02/03/2020

Algorithmic Complexity of Secure Connected Domination in Graphs

Let G = (V,E) be a simple, undirected and connected graph. A connected (...
research
06/17/2023

On the Complexity of Co-secure Dominating Set Problem

A set D ⊆ V of a graph G=(V, E) is a dominating set of G if every vertex...
research
11/11/2019

Paired Domination versus Domination and Packing Number in Graphs

Given a graph G=(V(G), E(G)), the size of a minimum dominating set, mini...
research
01/31/2020

Algorithmic Aspects of Some Variants of Domination in Graphs

A set S ⊆ V is a dominating set in G if for every u ∈ V ∖ S, there exist...
research
07/09/2020

Order-sensitive domination in partially ordered sets

For a (finite) partially ordered set (poset) P, we call a dominating set...
research
10/30/2018

Simultaneous Dominating Set for Spanning Tree Factorings

For a connected graph G we call a set F a spanning tree factoring of G i...

Please sign up or login with your details

Forgot password? Click here to reset