Distance-2 domatic numbers of grid graphs
This paper deals with distance-2 domatic numbers of grid graphs. A finite grid graph \(G_{m,n}\) is defined as the Cartesian product of paths \(P_n\) and \(P_m\). The infinite grid graph \(G_{\infty,\infty}\) is defined as the Cartesian product of two infinite paths. A vertex \(v\) in a graph \(G\) distance-2 dominates vertex \(u\) if the distance \(d(u,v)\leq 2\). A distance-2 dominating set is a set \(D\) of vertices that distance-2 dominate all vertices in \(V( G)\). A distance-2 domatic partition is a partition of \(V(G)\) into distance-2 dominating sets. The maximum number of sets in a distance-2 domatic partition is the distance-2 domatic number \(d_{\leq 2}(G)\).NEWLINENEWLINEThe values \(d_{\leq 2}(G_{m,n})\), where \(m\leq n\), are separately found for values \(m\in\{2,3,4,5\}\). Then, it is proved that \(d_{\leq 2}(G_{m,n})=6\) for all \(n\geq3\) and \(m\geq6\). At the end of the paper, the authors prove that \(d_{\leq 2}(G_{\infty,\infty})\) is equal to 13.
- Graph Domination in Distance Two
- Distance paired domination numbers of graphs
- Bounds on the distance two-domination number of a graph
- 2-distance paired-dominating number of graphs
- Graphs with equal domination and 2-distance domination numbers
- scientific article; zbMATH DE number 2024674
- scientific article; zbMATH DE number 1778131
- The 2-domination and Roman domination numbers of grid graphs
- Total 2-domination in grid graphs
- On domination number and distance in graphs
This page was built for publication: Distance-2 domatic numbers of grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799858)
