Vertex Covers and Secure Domination in Graphs
From MaRDI portal
Publication:3519295
DOI10.2989/QM.2008.31.2.5.477zbMath1154.05048OpenAlexW1992650104MaRDI QIDQ3519295
Alewyn P. Burger, Jan H. van Vuuren, Michael A. Henning
Publication date: 14 August 2008
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2989/qm.2008.31.2.5.477
Related Items (22)
Upper secure domination number of a graph ⋮ Protection of graphs with emphasis on Cartesian product graphs ⋮ Secure domination in proper interval graphs ⋮ Secure domination in cographs ⋮ On the secure domination numbers of maximal outerplanar graphs ⋮ Secure equitability in graphs ⋮ On computing a minimum secure dominating set in block graphs ⋮ The complexity of secure domination problem in graphs ⋮ Unnamed Item ⋮ A linear algorithm for secure domination in trees ⋮ From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs ⋮ A characterization of trees with equal independent domination and secure domination numbers ⋮ m-Secure vertex cover of a graph ⋮ Edge criticality in secure graph domination ⋮ Secure domination in rooted product graphs ⋮ Secure Italian domination in graphs ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Eternal and Secure Domination in Graphs ⋮ Protection of lexicographic product graphs ⋮ On minimum secure dominating sets of graphs ⋮ On secure domination in trees ⋮ Co-Roman domination in graphs
This page was built for publication: Vertex Covers and Secure Domination in Graphs