Integer and fractional security in graphs

DOI10.1016/J.DAM.2012.04.018MaRDI QIDQ442229zbMATH OpenOpenAlexFDO

Authors Garth Isaak, Caleb Petrie, P. 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)

Recommendations

• Security in Sierpiński graphs
• (F, I)-security in graphs
• Security in graphs
• Ultra-security in graphs
• Bounds on a graph's security number
• Secure equitability in graphs
• On secure domination in graphs
• About secure independence in graphs
• scientific article; zbMATH DE number 5139466
• The security number of strong grid-like graphs

Cites work

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

Cited in

(11)

• Global security in claw-free cubic graphs
• Secure sets and their expansion in cubic graphs
• Security in graphs
• scientific article; zbMATH DE number 5139466 (Why is no real title available?)
• On the security number of the Cartesian product of graphs
• (F, I)-security in graphs
• A graph theoretic method for securing key fobs
• Ultra-security in graphs
• On generalized distance secure sets in graphs
• Connected minimum secure-dominating sets in grids
• Security number of grid-like graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442229)