Vertex Covers and Secure Domination in Graphs
From MaRDI portal
Publication:3519295
Recommendations
Cited in
(29)- Secure domination in proper interval graphs
- On the secure domination numbers of maximal outerplanar graphs
- On computing a minimum secure dominating set in block graphs
- The complexity of secure domination problem in graphs
- Edge criticality in secure graph domination
- Secure domination in rooted product graphs
- Secure Italian domination in graphs
- Protection of lexicographic product graphs
- From (secure) w-domination in graphs to protection of lexicographic product graphs
- Co-Roman domination in graphs
- Secure domination in cographs
- A linear algorithm for secure domination in trees
- A note on secure domination in C₅-free graphs
- Upper secure domination number of a graph
- Eternal and Secure Domination in Graphs
- \(m\)-secure vertex cover of a graph
- Secure domination subdivision number of a graph
- A characterization of trees with equal independent domination and secure domination numbers
- Protection of graphs with emphasis on Cartesian product graphs
- On minimum secure dominating sets of graphs
- On secure domination in trees
- Secure domination parameters of Halin graph with perfect k-ary tree
- Secure equitability in graphs
- Secure total domination number in maximal outerplanar graphs
- A lower bound for secure domination number of an outerplanar graph
- Secure domination in P₅-free graphs
- Secure domination number of generalized thorn graphs
- Secure domination in generalized Sierpiński graphs
- Bounds on weak Roman and 2-rainbow domination numbers
This page was built for publication: Vertex Covers and Secure Domination in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519295)
