On a graph's security number
From MaRDI portal
Publication:1043972
DOI10.1016/j.disc.2009.02.005zbMath1205.05166MaRDI QIDQ1043972
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.02.005
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
The security number of lexicographic products, Secure domination of some graph operators, 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, Metastability and dynamics of discrete topological singularities in two dimensions: a \(\Gamma\)-convergence approach, The possible cardinalities of global secure sets in cographs, Alliances in graphs: parameters, properties and applications -- a survey, Monotonicity and expansion of global secure sets, Secure domination of honeycomb networks, On the security number of the Cartesian product of graphs, Global edge alliances in graphs, New solutions for slow moving kinks in a forced Frenkel-Kontorova chain, Security in Sierpiński graphs
Cites Work