Total domination number of grid graphs
From MaRDI portal
Publication:1613393
DOI10.1016/S0166-218X(01)00297-9zbMath0995.05109MaRDI QIDQ1613393
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
On coupon coloring of Cartesian product of some graphs, On the semitotal forcing number of a graph, Graph products of the trivariate total domination polynomial and related polynomials, Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\), Hamiltonian cycles in linear-convex supergrid graphs, Results on Total Restrained Domination number and subdivision number for certain graphs, Critical cyclic patterns related to the domination number of the torus, An upper bound for the total restrained domination number of graphs, Total $k$-domination in strong product graphs, Total restrained domination in graphs of diameter 2 or 3, Binary programming formulations for the upper domination problem, On domatic and total domatic numbers of Cartesian products of graphs, Efficient closed domination in digraph products, The domination numbers of cylindrical grid graphs, Total \(k\)-domination in Cartesian product graphs, Total and paired domination numbers of toroidal meshes, The numerical invariants concerning the total domination for generalized Petersen graphs, Total restrained domination numbers of trees, The Hamiltonian properties of supergrid graphs, Bounds on the size of the minimum dominating sets of some cylindrical grid graphs, The total bondage number of grid graphs, A survey of selected recent results on total domination in graphs, \([r,s,t\)-colorings of graph products], Total and paired domination numbers of cylinders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variations on tilings in the Manhattan metric
- On domination numbers of Cartesian products of paths
- Dominating Cartesian products of cycles
- Algebraic approach to fasciagraphs and rotagraphs
- The NP-completeness column: an ongoing guide
- The domination numbers of the 5 × n and 6 × n grid graphs
