On secure domination in graphs

DOI10.1016/j.ipl.2015.05.006zbMath1329.05223OpenAlexW248890345MaRDI QIDQ2348710

Houcine Boumediene Merouane, Mustapha Chellali

Publication date: 15 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.05.006

zbMATH Keywords

independencecomputational complexitycombinatorial problemsdominationsecure domination

Mathematics Subject Classification ID

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

Related Items (28)

Complexity issues of perfect secure domination in graphs ⋮ An improved binary programming formulation for the secure domination problem ⋮ Protection of graphs with emphasis on Cartesian product graphs ⋮ Secure domination in proper interval graphs ⋮ Complexity issues of variants of secure domination in graphs ⋮ Secure domination in cographs ⋮ On the secure domination numbers of maximal outerplanar graphs ⋮ Complexity results on cosecure domination in graphs ⋮ Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang ⋮ Cosecure domination: hardness results and algorithms ⋮ Algorithmic aspects of secure domination in unit disk graphs ⋮ Some new algorithmic results on co-secure domination in graphs ⋮ On the complexity of co-secure dominating set problem ⋮ On computing a minimum secure dominating set in block graphs ⋮ The complexity of secure domination problem in graphs ⋮ A note on secure domination in \(C_5\)-free graphs ⋮ Unnamed Item ⋮ The secure domination problem in cographs ⋮ Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee ⋮ From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs ⋮ A characterization of trees with equal independent domination and secure domination numbers ⋮ Secure domination in rooted product graphs ⋮ Secure Italian domination in graphs ⋮ The complexity of the defensive domination problem in special graph classes ⋮ Algorithmic aspects of secure connected domination in graphs ⋮ Eternal and Secure Domination in Graphs ⋮ Protection of lexicographic product graphs ⋮ On secure domination in trees

Cites Work

• Dominating sets for split and bipartite graphs
• Secure domination and secure total domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On secure domination in graphs