The domination numbers of cylindrical grid graphs
From MaRDI portal
Publication:627140
DOI10.1016/j.amc.2010.11.019zbMath1223.05214OpenAlexW2031680558MaRDI QIDQ627140
Avishek Adhikari, Mrinal Nandi, Subrata Parui
Publication date: 21 February 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.11.019
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
The independent domination numbers of strong product of two cycles ⋮ Dominator colorings of certain Cartesian products of paths and cycles ⋮ SIGNED STAR DOMINATION IN GRAPHS ⋮ Hamiltonian paths in some classes of grid graphs ⋮ Bounds on the size of the minimum dominating sets of some cylindrical grid graphs ⋮ A general lower bound for the domination number of cylindrical graphs ⋮ The secure domination number of Cartesian products of small graphs with paths and cycles ⋮ Total and paired domination numbers of cylinders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of ray tube area in geometrical shock dynamics
- Bibliography on domination in graphs and some basic definitions of domination parameters
- 1-soliton solution of Kadomtsev-Petviashvili equation with power law nonlinearity
- A similarity measure for graphs with low computational complexity
- On the domination number of the Cartesian product of the cycle of length \(n\) and any graph
- Information processing in complex networks: Graph entropy and information functionals
- Optical solitons in a parabolic law media with fourth order dispersion
- Analytic \(N\)-solitary-wave solution of a variable-coefficient Gardner equation from fluid dynamics and plasma physics
- Unit disk graphs
- Elements of a theory of computer simulation. I
- Parallel concepts in graph theory
- Total domination number of grid graphs
- Signed domination in regular graphs
- Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
- Dominating Cartesian products of cycles
- A DNA-based graph encoding scheme with its applications to graph isomorphism problems
- A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
- Soliton-soliton interaction with dual-power law nonlinearity
- Synthesis of Switching Functions by Linear Graph Theory
- The domination numbers of the 5 × n and 6 × n grid graphs
This page was built for publication: The domination numbers of cylindrical grid graphs
