Secure sets and their expansion in cubic graphs
From MaRDI portal
(Redirected from Publication:403188)
Recommendations
- SECURE DOMINATING SETS AND SECURE DOMINATION POLYNOMIALS OF CYCLES
- The possible cardinalities of global secure sets in cographs
- Security in Sierpiński graphs
- Global security in claw-free cubic graphs
- Complexity of secure sets
- Complexity of secure sets
- Secure dominating sets in the lexicographic product of graphs
- Secure domination and secure total domination in graphs
- Integer and fractional security in graphs
- On minimum secure dominating sets of graphs
Cites work
- scientific article; zbMATH DE number 2104820 (Why is no real title available?)
- Bounds on a graph's security number
- Bounds on global secure sets in cactus trees
- Generation of cubic graphs
- Global defensive alliances in graphs
- Global secure sets of grid-like graphs
- House of Graphs: a database of interesting graphs
- Matching cutsets in graphs
- Monotonicity and expansion of global secure sets
- On a graph's security number
- On the global offensive alliance number of a graph
- Powerful alliances in graphs
- Security in graphs
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- The possible cardinalities of global secure sets in cographs
Cited in
(3)
This page was built for publication: Secure sets and their expansion in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403188)
