Bounds on a graph's security number
From MaRDI portal
Publication:2476256
DOI10.1016/j.dam.2007.08.037zbMath1135.05048MaRDI QIDQ2476256
Publication date: 18 March 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.037
05C35: Extremal problems in graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C07: Vertex degrees
Related Items
The security number of strong grid-like graphs, Global security in claw-free cubic graphs, Secure sets and their expansion in cubic graphs, Global secure sets of grid-like graphs, \((F, I)\)-security in graphs, The possible cardinalities of global secure sets in cographs, Security number of grid-like graphs, On a graph's security number, Monotonicity and expansion of global secure sets
Cites Work