Secure total domination in graphs: bounds and complexity
DOI10.1016/J.DAM.2016.08.018zbMATH Open1396.05084OpenAlexW2586796145MaRDI QIDQ1786876FDOQ1786876
Authors: 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
Recommendations
computational complexityapproximation algorithmssecure total dominating setsecure total domination number
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clustering and domination in perfect graphs
- Face covers and the genus problem for apex graphs
- Title not available (Why is that?)
- Total domination in graphs
- A survey of selected recent results on total domination in graphs
- Title not available (Why is that?)
- Dominating sets for split and bipartite graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Title not available (Why is that?)
- Approximation hardness of dominating set problems in bounded degree graphs
- Secure domination and secure total domination in graphs
- Secure total domination in graphs
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
- Graphs of separability at most 2
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- Domination in the corona and join of graphs
Cited In (23)
- Complexity issues of perfect secure domination in graphs
- Secure domination of some graph operators
- Algorithmic aspects of secure connected domination in graphs
- On computing secure domination of trees
- On the secure domination numbers of maximal outerplanar graphs
- The complexity of secure domination problem in graphs
- Algorithmic results in secure total dominating sets on graphs
- Graphs with diameter 2 and large total domination number
- An algorithm for the secure total domination problem in proper interval graphs
- Secure total domination in graphs
- Secure Italian domination in graphs
- From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs
- Eternal and Secure Domination in Graphs
- Secure total domination in chain graphs and cographs
- Differentiating-total domination: approximation and hardness results
- On secure domination in graphs
- Total protection of lexicographic product graphs
- Algorithmic aspects of 2-secure domination in graphs
- Secure domination and secure total domination in graphs
- Algorithmic complexity of secure connected domination in graphs
- On the complexity of strong and weak total domination in graphs
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
- Secure total domination number in maximal outerplanar graphs
This page was built for publication: Secure total domination in graphs: bounds and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786876)
