Secure total domination in graphs: bounds and complexity
type: Item
instance of: scholarly article
title: Secure total domination in graphs: bounds and complexity
zbMATH Open document ID: 1396.05084
author: Oleg Duginov
published in: Discrete Applied Mathematics
publication date: 2018-09-25T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6943438
zbMATH Keywords: secure total dominating set
zbMATH Keywords: secure total domination number
zbMATH Keywords: computational complexity
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2016.08.018
OpenAlex ID: W2586796145
cites work: Q5503336
cites work: Dominating sets for split and bipartite graphs
cites work: Approximation hardness of dominating set problems in bounded degree graphs
cites work: Graphs of separability at most 2
cites work: Q5461685
cites work: Clustering and domination in perfect graphs
cites work: Q3097062
cites work: Q4368729
cites work: Q4368728
cites work: A survey of selected recent results on total domination in graphs
cites work: Total Domination in Graphs
cites work: Q4523707
cites work: Secure domination and secure total domination in graphs
cites work: Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
cites work: Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
cites work: Face covers and the genus problem for apex graphs
cites work: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
cites work: Q4258215
DOI: 10.1016/J.DAM.2016.08.018
description: scientific article; zbMATH DE number 6943438