Bounds on the size of the minimum dominating sets of some cylindrical grid graphs (Q2248727): Difference between revisions

Summary: Let \(\gamma(P_m\square C_n)\) denote the domination number of the cylindrical grid graph formed by the Cartesian product of the graphs \(P_m\), the path of length \(m\), \(m\geq 2\) and the graph \(C_n\), the cycle of length \(n\), \(n\geq 3\). In this paper we propose methods to find the domination numbers of graphs of the form \(P_m\square C_n\) with \(n\geq 3\) and \(m=5\) and propose tight bounds on domination numbers of the graphs \(P_6\square C_n\), \(n\geq 3\). Moreover, we provide rough bounds on domination numbers of the graphs \(P_m\square C_n\), \(n\geq 3\) and \(m\geq 7\). We also point out how domination numbers and minimum dominating sets are useful for wireless sensor networks.