On computing a minimum secure dominating set in block graphs

D. Pradhan () and Anupriya Jha ()
Additional contact information
D. Pradhan: Indian Institute of Technology (ISM), Dhanbad
Anupriya Jha: Indian Institute of Technology (ISM), Dhanbad

Journal of Combinatorial Optimization, 2018, vol. 35, issue 2, No 20, 613-631

Abstract: Abstract In a graph $$G=(V,E)$$ G = ( V , E ) , a set $$D \subseteq V$$ D ⊆ V is said to be a dominating set of G if for every vertex $$u\in V{\setminus }D$$ u ∈ V \ D , there exists a vertex $$v\in D$$ v ∈ D such that $$uv\in E$$ u v ∈ E . A secure dominating set of the graph G is a dominating set D of G such that for every $$u\in V{\setminus }D$$ u ∈ V \ D , there exists a vertex $$v\in D$$ v ∈ D such that $$uv\in E$$ u v ∈ E and $$(D{\setminus }\{v\})\cup \{u\}$$ ( D \ { v } ) ∪ { u } is a dominating set of G. Given a graph G and a positive integer k, the secure domination problem is to decide whether G has a secure dominating set of cardinality at most k. The secure domination problem has been shown to be NP-complete for chordal graphs via split graphs and for bipartite graphs. In Liu et al. (in: Proceedings of 27th workshop on combinatorial mathematics and computation theory, 2010), it is asked to find a polynomial time algorithm for computing a minimum secure dominating set in a block graph. In this paper, we answer this by presenting a linear time algorithm to compute a minimum secure dominating set in block graphs. We then strengthen the known NP-completeness of the secure domination problem by showing that the secure domination problem is NP-complete for undirected path graphs and chordal bipartite graphs.

Keywords: Domination; Secure domination; Block graphs; Linear time algorithm; NP-complete (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0197-y 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:35:y:2018:i:2:d:10.1007_s10878-017-0197-y

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

DOI: 10.1007/s10878-017-0197-y

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 ().