Security number of grid-like graphs

DOI10.1016/j.dam.2009.03.020zbMath1211.05118OpenAlexW2008749427MaRDI QIDQ967295

Koichi Yamazaki, Kyohei Kozawa, Yota Otachi

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.03.020

zbMATH Keywords

toruscylindergridsecurity number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

The security number of strong grid-like graphs ⋮ Global security in claw-free 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 ⋮ Bandwidth and pathwidth of three-dimensional grids ⋮ Monotonicity and expansion of global secure sets ⋮ \((F, I)\)-security in graphs ⋮ The possible cardinalities of global secure sets in cographs

Cites Work

• Unnamed Item
• Unnamed Item
• On tree congestion of graphs
• On spanning tree congestion of graphs
• Security in graphs
• Lower bounds on the pathwidth of some grid-like graphs
• Bounds on a graph's security number
• An Ordering on the Even Discrete Torus

This page was built for publication: Security number of grid-like graphs