Two algorithms for secure graph domination

MaRDI QIDQ5298923zbMATH OpenFDO

Authors A. P. Burger, Anton P. de Villiers, J. H. van Vuuren

Publication date 25 June 2013

zbMATH Keywords

secure dominating setsecure domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A linear algorithm for secure domination in trees
• Secure domination in cographs
• On computing secure domination of trees
• Secure domination in proper interval graphs
• The secure domination problem in cographs

Cited in

(16)

• Secure domination in proper interval graphs
• On the secure domination numbers of maximal outerplanar graphs
• On computing a minimum secure dominating set in block graphs
• The secure domination problem in cographs
• A simple algorithm for secure domination in proper interval graphs
• Algorithmic aspects of 2-secure domination in graphs
• The secure domination number of Cartesian products of small graphs with paths and cycles
• Secure domination in cographs
• A linear algorithm for secure domination in trees
• Eternal and Secure Domination in Graphs
• A characterization of trees with equal independent domination and secure domination numbers
• On secure domination in trees
• Binary programming formulations for the upper domination problem
• Algorithmic aspects of secure domination in unit disk graphs
• The algorithm and complexity of secure domination in 3-dimensional box graphs
• An improved binary programming formulation for the secure domination problem

This page was built for publication: Two algorithms for secure graph domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298923)