Edge criticality in secure graph domination

DOI10.1016/j.disopt.2015.08.001zbMath1387.05179OpenAlexW2096436898MaRDI QIDQ1751134

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

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.08.001

zbMATH Keywords

edge removalsecure dominationgraph protectionedge criticality

Mathematics Subject Classification ID

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

Related Items (5)

A characterization of trees with equal independent domination and secure domination numbers ⋮ Certified domination ⋮ Algorithmic aspects of secure connected domination in graphs ⋮ Eternal and Secure Domination in Graphs ⋮ Convex dominating sets in maximal outerplanar graphs

Cites Work

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

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