The Domination Number of Grids

From MaRDI portal
Publication:3225132

DOI10.1137/11082574zbMath1237.05150arXiv1102.5206OpenAlexW1590776067MaRDI QIDQ3225132

Daniel Gonçalves, Michaël Rao, Alexandre Pinlou, Steéphan Thomassé

Publication date: 15 March 2012

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

Full work available at URL: https://arxiv.org/abs/1102.5206




Related Items (51)

Domination with decay in triangular matchstick arrangement graphsOptimization of wireless sensor networks deployment with coverage and connectivity constraintsThe connected domination number of gridsTransferable domination number of graphsDominating problems in swapped networksTotal and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\)A New Distributed Algorithm for Computing a Dominating Set on GridsEfficient location of resources in cylindrical networksOn the 2-domination Number of Cylinders with Small CyclesAsymptotic growth rate of square grids dominating sets: a symbolic dynamics approachEternal domination: \(D\)-dimensional Cartesian and strong grids and everything in betweenOptimal covering of the equidistant square grid networkOn minimum identifying codes in some Cartesian product graphsThe 2-domination number of cylindrical graphsBinary programming formulations for the upper domination problemDisjoint dominating sets with a perfect matchingDomination criticality in product graphs2-limited broadcast domination on grid graphsRoman {2}-domination in Graphs and Graph ProductsProjects in (t, r) Broadcast DominationThe restrained domination and independent restrained domination in extending supergrid graphsThe domination number of Cartesian product of two directed pathsOptimal \((t, r)\) broadcasts on the infinite gridDominating sequences in grid-like and toroidal graphsStudy of a combinatorial game in graphs through linear programmingIndependent [1,2-domination of grids via min-plus algebra] ⋮ Partial domination - the isolation number of a graphOn 2-limited packings of complete grid graphsThe domination number of \(K_n^3\)The domination complexity and related extremal values of large 3D torusIce sliding gamesAn explicit construction of optimal dominating and [1, 2–dominating sets in grid] ⋮ A method for eternally dominating strong gridsUnnamed ItemNumber of dominating sets in cylindric square grid graphsDomination in ChessboardsRainbow Domination in GraphsReconfiguring dominating sets in minor-closed graph classesA general lower bound for the domination number of cylindrical graphsBounds on watching and watching graph productsThe secure domination number of Cartesian products of small graphs with paths and cyclesUnnamed ItemProduct throttlingPower domination on triangular grids with triangular and hexagonal shapeEternally dominating large gridsA Survey of the Game “Lights Out!”My Top 10 Graph Theory Conjectures and Open ProblemsTotal and paired domination numbers of cylindersThe integer {k}-domination number of circulant graphsIndependent domination of gridsOn \((t,r)\) broadcast domination numbers of grids




This page was built for publication: The Domination Number of Grids