Independent domination of grids

DOI10.1016/j.disc.2015.02.015zbMath1310.05158OpenAlexW2081782770MaRDI QIDQ2342624

Simon Crevals, Patric R. J. Östergård

Publication date: 29 April 2015

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

Full work available at URL: https://doi.org/10.1016/j.disc.2015.02.015

zbMATH Keywords

grid graphindependent domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Dynamic programming (90C39) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Efficient location of resources in cylindrical networks ⋮ Every grid has an independent \([1, 2\)-set] ⋮ Bounds on the domination number of a digraph ⋮ Independent [1,2-domination of grids via min-plus algebra] ⋮ Bounds on watching and watching graph products

Cites Work

• Computing the domination number of grid graphs
• On graphs with equal domination and independent domination numbers
• Independent domination in graphs: A survey and recent results
• The Domination Number of Grids
• The domination numbers of the 5 × n and 6 × n grid graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Independent domination of grids