Secure total domination in graphs: bounds and complexity

DOI10.1016/j.dam.2016.08.018zbMath1396.05084OpenAlexW2586796145MaRDI QIDQ1786876

Oleg Duginov

Publication date: 25 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.08.018

zbMATH Keywords

computational complexityapproximation algorithmssecure total dominating setsecure total domination number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (8)

Algorithmic results in secure total dominating sets on graphs ⋮ Total protection of lexicographic product graphs ⋮ Graphs with diameter 2 and large total domination number ⋮ Secure domination of some graph operators ⋮ Secure connected domination and secure total domination in unit disk graphs and rectangle graphs ⋮ From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs ⋮ Secure total domination in chain graphs and cographs ⋮ Eternal and Secure Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
• Graphs of separability at most 2
• Dominating sets for split and bipartite graphs
• Approximation hardness of dominating set problems in bounded degree graphs
• A survey of selected recent results on total domination in graphs
• Clustering and domination in perfect graphs
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• Face covers and the genus problem for apex graphs
• Secure domination and secure total domination in graphs
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• Total Domination in Graphs

This page was built for publication: Secure total domination in graphs: bounds and complexity