Edge stability in secure graph domination

zbMATH Open1310.05156MaRDI QIDQ5249231FDOQ5249231

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

Publication date: 30 April 2015

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2682/0.html

Recommendations

• Edge criticality in secure graph domination
• The cost of edge failure with respect to secure graph domination
• Secure domination critical graphs
• On secure domination in graphs
• Perfect secure domination in graphs

zbMATH Keywords

edge removalsecure dominationgraph protection

Mathematics Subject Classification ID

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

Cited In (4)

• Edge criticality in secure graph domination
• On computing a minimum secure dominating set in block graphs
• Eternal and Secure Domination in Graphs
• The cost of edge failure with respect to secure graph domination

Uses Software

• Boost
• BGL

This page was built for publication: Edge stability in secure graph domination

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