Complexity issues of variants of secure domination in graphs

DOI10.1016/j.endm.2017.11.001zbMath1383.05241OpenAlexW2774310888MaRDI QIDQ2413340

J. Pavan Kumar, P. Venkata Subba Reddy, Devendra Lad

Publication date: 10 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.11.001

zbMATH Keywords

split graphNP-completenesstotal dominationsecure dominating set

Mathematics Subject Classification ID

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

Related Items

An improved binary programming formulation for the secure domination problem, Algorithmic aspects of 2-secure domination in graphs, Eternal and Secure Domination in Graphs

Cites Work

• Approximation algorithms for connected dominating sets
• On secure domination in graphs
• Unnamed Item
• Unnamed Item