Global secure sets of grid-like graphs
From MaRDI portal
Publication:628346
DOI10.1016/J.DAM.2010.12.013zbMATH Open1209.05172OpenAlexW1976167318MaRDI QIDQ628346FDOQ628346
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.013
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Secure set algorithms and complexity
- Title not available (Why is that?)
- On a graph's security number
- Security in graphs
- Bounds on a graph's security number
- Global secure sets of grid-like graphs
- Security number of grid-like graphs
- Secure domination critical graphs
- Secure domination and secure total domination in graphs
- Title not available (Why is that?)
- Rooted secure sets of trees
- Parameterized complexity of secure sets
Cited In (12)
- Global security in claw-free cubic graphs
- Secure sets and their expansion in cubic graphs
- Security in Sierpiński graphs
- On the security number of the Cartesian product of graphs
- Complexity of secure sets
- The security number of strong grid-like graphs
- Global secure sets of grid-like graphs
- The possible cardinalities of global secure sets in cographs
- Security number of grid-like graphs
- The security number of lexicographic products
- Global edge alliances in graphs
- Complexity of Secure Sets
This page was built for publication: Global secure sets of grid-like graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628346)
