The security number of strong grid-like graphs

DOI10.1016/j.tcs.2016.09.013zbMath1353.05107OpenAlexW2526385952WikidataQ115036519 ScholiaQ115036519MaRDI QIDQ329713

Ismael González Yero, Dorota Kuziak, Marko Jakovac

Publication date: 21 October 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.013

zbMATH Keywords

toruscylindergridsecure setsecurity numberstrong product graph

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

The security number of lexicographic products ⋮ On the security number of the Cartesian product of graphs

Cites Work

• Unnamed Item
• Bounds on global secure sets in cactus trees
• Global secure sets of grid-like 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
• Security in graphs
• Bounds on a graph's security number

This page was built for publication: The security number of strong grid-like graphs