Note on the secure-domination number of a graph

MaRDI QIDQ5500165zbMATH OpenFDO

Authors Matthew Devilbiss, Bradley Fain, Ryan Matzke, P. D. jun. Johnson

Publication date 5 August 2015

Mathematics Subject Classification ID

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

Recommendations

• On secure domination in graphs
• On the secure-domination number of the full balanced binary tree
• scientific article; zbMATH DE number 2188623
• On secure domination in trees
• Secure domination and secure total domination in graphs

Cited in

(4)

• On the secure-domination number of the full balanced binary tree
• On the secure domination numbers of maximal outerplanar graphs
• scientific article; zbMATH DE number 5139466 (Why is no real title available?)
• Equalityof Secure Domination and Inverse Secure Domination Numbers

This page was built for publication: Note on the secure-domination number of a graph

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