On minimum secure dominating sets of graphs

DOI10.2989/16073606.2015.1068238MaRDI QIDQ5233913zbMATH OpenOpenAlexFDO

Authors A. P. Burger, Anton P. de Villiers, J. 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

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

Recommendations

• Perfect secure domination in graphs
• Security in Sierpiński graphs
• Secure domination and secure total domination in graphs
• Vertex Covers and Secure Domination in Graphs
• On secure domination in trees

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2094533 (Why is no real title available?)
• scientific article; zbMATH DE number 2104838 (Why is no real title available?)
• scientific article; zbMATH DE number 2114685 (Why is no real title available?)
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• scientific article; zbMATH DE number 2188623 (Why is no real title available?)
• Irredundance, secure domination and maximum degree in trees
• Secure domination critical graphs
• Vertex Covers and Secure Domination in Graphs

Cited in

(21)

• Secure domination in cographs
• Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang
• Secure sets and their expansion in cubic graphs
• Edge criticality in secure graph domination
• Vertex Covers and Secure Domination in Graphs
• On the secure domination numbers of maximal outerplanar graphs
• On computing a minimum secure dominating set in block graphs
• Security in Sierpiński graphs
• An algorithm for the secure total domination problem in proper interval graphs
• On secure domination in trees
• Eternal and Secure Domination in Graphs
• A lower bound for secure domination number of an outerplanar graph
• The complexity of the defensive domination problem in special graph classes
• Secure domination in proper interval graphs
• Secure domination in P₅-free graphs
• Connected minimum secure-dominating sets in grids
• Secure domination and secure total domination in graphs
• A characterization of trees with equal independent domination and secure domination numbers
• The secure domination problem in cographs
• Perfect secure domination in graphs
• Secure total domination number in maximal outerplanar graphs

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

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