Global secure domination in graphs
From MaRDI portal
Recommendations
Cited in
(8)- Global security in claw-free cubic graphs
- Secure domination of some graph operators
- Eternal and Secure Domination in Graphs
- Upper secure domination number of a graph
- Global secure sets of grid-like graphs
- The possible cardinalities of global secure sets in cographs
- Monotonicity and expansion of global secure sets
- Perfect secure domination in graphs
This page was built for publication: Global secure domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683529)