Bounds on the size of the minimum dominating sets of some cylindrical grid graphs
From MaRDI portal
Publication:2248727
DOI10.1155/2014/348359zbMath1295.05178OpenAlexW1965742418WikidataQ59043544 ScholiaQ59043544MaRDI QIDQ2248727
Avishek Adhikari, Subrata Parui, Mrinal Nandi
Publication date: 27 June 2014
Published in: International Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/348359
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- The domination numbers of cylindrical grid graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- On the domination number of the Cartesian product of the cycle of length \(n\) and any graph
- Unit disk graphs
- Total domination number of grid graphs
- Signed domination in regular graphs
- Dominating Cartesian products of cycles
- 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
This page was built for publication: Bounds on the size of the minimum dominating sets of some cylindrical grid graphs