Algorithmic aspects of 2-secure domination in graphs

Pavan Kumar Jakkepalli () and Venkata Subba Reddy Palagiri ()
Additional contact information
Pavan Kumar Jakkepalli: National Institute of Technology
Venkata Subba Reddy Palagiri: National Institute of Technology

Journal of Combinatorial Optimization, 2021, vol. 42, issue 1, No 4, 56-70

Abstract: Abstract Let G(V, E) be a simple, connected and undirected graph. A dominating set $$S \subseteq V$$ S ⊆ V is called a 2-secure dominating set (2-SDS) in G, if for each pair of distinct vertices $$v_1,v_2 \in V$$ v 1 , v 2 ∈ V there exists a pair of distinct vertices $$u_1,u_2 \in S$$ u 1 , u 2 ∈ S such that $$u_1 \in N[v_1]$$ u 1 ∈ N [ v 1 ] , $$u_2 \in N[v_2]$$ u 2 ∈ N [ v 2 ] and $$(S {\setminus } \{u_1,u_2\}) \cup \{v_1,v_2 \}$$ ( S \ { u 1 , u 2 } ) ∪ { v 1 , v 2 } is a dominating set in G. The size of a minimum 2-SDS in G is said to be 2-secure domination number denoted by $$\gamma _{2s}(G)$$ γ 2 s ( G ) . The 2-SDM problem is to check if an input graph G has a 2-SDS S, with $$ \vert S \vert \le k$$ | S | ≤ k , where $$ k \in \mathbb {Z}^+ $$ k ∈ Z + . It is proved that for bipartite graphs 2-SDM is NP-complete. In this paper, we prove that the 2-SDM problem is NP-complete for planar graphs and doubly chordal graphs, a subclass of chordal graphs. We reinforce the existing NP-complete result for bipartite graphs, by proving 2-SDM is NP-complete for some subclasses of bipartite graphs specifically, comb convex bipartite and star convex bipartite graphs. We prove that this problem is linear time solvable for bounded tree-width graphs. We also show that the 2-SDM is W[2]-hard even for split graphs. The M2SDS problem is to find a 2-SDS of minimum size in the given graph. We give a $$ \varDelta +1 $$ Δ + 1 -approximation algorithm for M2SDS, where $$ \varDelta $$ Δ is the maximum degree of the given graph and prove that M2SDS cannot be approximated within $$ (1 - \epsilon ) \ln (\vert V \vert ) $$ ( 1 - ϵ ) ln ( | V | ) for any $$ \epsilon > 0 $$ ϵ > 0 unless $$ NP \subseteq DTIME(\vert V \vert ^{ O(\log \log \vert V \vert )}) $$ N P ⊆ D T I M E ( | V | O ( log log | V | ) ) . Finally, we prove that the M2SDS is APX-complete for graphs with $$\varDelta =4.$$ Δ = 4 .

Keywords: 2-Secure domination; W[2]-hard; Planar graphs; APX-complete; Star convex bipartite graphs; Inapproximability; 68Q25; 05C69 (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00739-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:42:y:2021:i:1:d:10.1007_s10878-021-00739-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00739-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().