The following pages link to The Domination Number of Grids (Q3225132):
Displayed 50 items.
- Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\) (Q306109) (← links)
- Dominating sequences in grid-like and toroidal graphs (Q504964) (← links)
- Independent [1,2]-domination of grids via min-plus algebra (Q510530) (← links)
- On 2-limited packings of complete grid graphs (Q526269) (← links)
- Power domination on triangular grids with triangular and hexagonal shape (Q782760) (← links)
- Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← links)
- The connected domination number of grids (Q831725) (← links)
- Transferable domination number of graphs (Q833006) (← links)
- Domination criticality in product graphs (Q896090) (← links)
- Efficient location of resources in cylindrical networks (Q1646261) (← links)
- Optimal \((t, r)\) broadcasts on the infinite grid (Q1727739) (← links)
- The domination complexity and related extremal values of large 3D torus (Q1791110) (← links)
- Ice sliding games (Q1791286) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- Number of dominating sets in cylindric square grid graphs (Q2042212) (← links)
- Reconfiguring dominating sets in minor-closed graph classes (Q2053687) (← links)
- Bounds on watching and watching graph products (Q2062673) (← links)
- The secure domination number of Cartesian products of small graphs with paths and cycles (Q2065763) (← links)
- Product throttling (Q2073191) (← links)
- Total and paired domination numbers of cylinders (Q2091165) (← links)
- Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach (Q2173304) (← links)
- A general lower bound for the domination number of cylindrical graphs (Q2305647) (← links)
- Eternally dominating large grids (Q2328863) (← links)
- Independent domination of grids (Q2342624) (← links)
- On \((t,r)\) broadcast domination numbers of grids (Q2348050) (← links)
- Domination with decay in triangular matchstick arrangement graphs (Q2357662) (← links)
- On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
- The domination number of Cartesian product of two directed paths (Q2436670) (← links)
- The domination number of \(K_n^3\) (Q2509551) (← links)
- Dominating problems in swapped networks (Q2629991) (← links)
- Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between (Q2663714) (← links)
- Optimal covering of the equidistant square grid network (Q2663999) (← links)
- The 2-domination number of cylindrical graphs (Q2678854) (← links)
- The restrained domination and independent restrained domination in extending supergrid graphs (Q2695306) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- Domination in Chessboards (Q3384118) (← links)
- Rainbow Domination in Graphs (Q3384615) (← links)
- A New Distributed Algorithm for Computing a Dominating Set on Grids (Q3452568) (← links)
- Disjoint dominating sets with a perfect matching (Q4595255) (← links)
- An explicit construction of optimal dominating and [1, 2]–dominating sets in grid (Q4956183) (← links)
- On the 2-domination Number of Cylinders with Small Cycles (Q5074058) (← links)
- (Q5109047) (← links)
- Projects in (t, r) Broadcast Domination (Q5118419) (← links)
- A method for eternally dominating strong grids (Q5130743) (← links)
- (Q5136239) (← links)
- Partial domination - the isolation number of a graph (Q5162046) (← links)
- My Top 10 Graph Theory Conjectures and Open Problems (Q5506779) (← links)
- The integer {k}-domination number of circulant graphs (Q5858164) (← links)
- Binary programming formulations for the upper domination problem (Q6080758) (← links)
- 2-limited broadcast domination on grid graphs (Q6110604) (← links)