Integer and fractional security in graphs

DOI10.1016/j.dam.2012.04.018zbMath1246.05120OpenAlexW2055163707MaRDI QIDQ442229

Garth Isaak, Caleb Petrie, Peter D. jun. Johnson

Publication date: 10 August 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.04.018

zbMATH Keywords

Hall's theoreminteger attackinteger defensesecure sets

Mathematics Subject Classification ID

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

Related Items (4)

Connected minimum secure-dominating sets in grids ⋮ Global security in claw-free cubic graphs ⋮ On the security number of the Cartesian product of graphs ⋮ \((F, I)\)-security in graphs

Cites Work

• Security in graphs
• Representation of systems of measurable sets
• On Representatives of Subsets
• A Theorem on General Measure Functions
• The Marriage Problem

This page was built for publication: Integer and fractional security in graphs