On minimum secure dominating sets of graphs

DOI10.2989/16073606.2015.1068238zbMath1419.05164OpenAlexW2329407138MaRDI QIDQ5233913

Alewyn P. Burger, Anton P. de Villiers, Jan H. van Vuuren

Publication date: 9 September 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2015.1068238

zbMATH Keywords

secure dominationgraph protection

Mathematics Subject Classification ID

Graph theory (05C99) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

Secure domination in proper interval graphs ⋮ Secure domination in cographs ⋮ On the secure domination numbers of maximal outerplanar graphs ⋮ Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang ⋮ On computing a minimum secure dominating set in block graphs ⋮ The secure domination problem in cographs ⋮ A characterization of trees with equal independent domination and secure domination numbers ⋮ The complexity of the defensive domination problem in special graph classes ⋮ Eternal and Secure Domination in Graphs ⋮ On secure domination in trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irredundance, secure domination and maximum degree in trees
• Secure domination critical graphs
• Vertex Covers and Secure Domination in Graphs

This page was built for publication: On minimum secure dominating sets of graphs