Algorithmic Complexity of Secure Connected Domination in Graphs
share
Let G = (V,E) be a simple, undirected and connected graph. A connected (total) dominating set S ⊆ V is a secure connected (total) dominating set of G, if for each u ∈ V ∖ S, there exists v ∈ S such that uv ∈ E and (S ∖ v ) ∪ u is a connected (total) dominating set of G. The minimum cardinality of a secure connected (total) dominating set of G denoted by γ_sc (G) (γ_st(G)), is called the secure connected (total) domination number of G. In this paper, we show that the decision problems corresponding to secure connected domination number and secure total domination number are NP-complete even when restricted to split graphs or bipartite graphs. The NP-complete reductions also show that these problems are w[2]-hard. We also prove that the secure connected domination problem is linear time solvable in block graphs and threshold graphs.
READ FULL TEXT
