Global secure sets of grid-like graphs

DOI10.1016/J.DAM.2010.12.013zbMath1209.05172OpenAlexW1976167318MaRDI QIDQ628346

Yiu Yu Ho, Ronald D. Dutton

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

zbMATH Keywords

cycleCartesian productdominating setgrid graphsecurity number

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (9)

The security number of strong grid-like graphs ⋮ Global edge alliances in graphs ⋮ Global security in claw-free cubic graphs ⋮ Secure sets and their expansion in cubic graphs ⋮ Global secure sets of grid-like graphs ⋮ The security number of lexicographic products ⋮ On the security number of the Cartesian product of graphs ⋮ Complexity of secure sets ⋮ Complexity of Secure Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rooted secure sets of trees
• Global secure sets of grid-like graphs
• Security number of grid-like graphs
• On a graph's security number
• Secure domination critical graphs
• Security in graphs
• Bounds on a graph's security number
• Secure domination and secure total domination in graphs

This page was built for publication: Global secure sets of grid-like graphs