The complexity of secure domination problem in graphs
type: Item
instance of: scholarly article
title: The complexity of secure domination problem in graphs
zbMATH Open document ID: 1390.05182
publication date: 2018-03-23T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6852326
zbMATH Keywords: secure domination
zbMATH Keywords: star convex bipartite graph
zbMATH Keywords: doubly chordal graph
zbMATH Keywords: NP-completeness
zbMATH Keywords: APX-completeness
author: Haichao Wang
author: Yancai Zhao
author: Yun-Ping Deng
MaRDI profile type: Publication
full work available at URL: dmgt.2008
OpenAlex ID: W2738841429
cites work: Some APX-completeness results for cubic graphs
cites work: Q4258216
cites work: Dominating sets for split and bipartite graphs
cites work: Dually Chordal Graphs
cites work: Vertex Covers and Secure Domination in Graphs
cites work: A linear algorithm for secure domination in trees
cites work: Q5173719
cites work: Approximation hardness of dominating set problems in bounded degree graphs
cites work: Irredundance, secure domination and maximum degree in trees
cites work: Q5461685
cites work: Incidence matrices and interval graphs
cites work: Q4198056
cites work: Secure domination critical graphs
cites work: Q4552196
cites work: Q4368729
cites work: Q4368728
cites work: Two Hardness Results on Feedback Vertex Sets
cites work: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
cites work: Secure domination and secure total domination in graphs
cites work: On secure domination in graphs
cites work: Q5461705
cites work: Optimization, approximation, and complexity classes
DOI: 10.7151/DMGT.2008
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 6852326