The integer $\{2\}$-domination number of grids
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916593412341760 |
|---|---|
| author | Lee, Jia-Ying Liu, Chia-An |
| author_facet | Lee, Jia-Ying Liu, Chia-An |
| contents | For positive integers $m$ and $n$, the grid graph $G_{m,n}$ is the Cartesian product of the path graph $P_m$ on $m$ vertices and the path graph $P_n$ on $n$ vertices. An integer $\{2\}$-dominating function of a graph is a mapping from the vertex set to $\{0,1,2\}$ such that the sum of the mapped values of each vertex and its neighbors is at least $2$; the integer $\{2\}$-domination number of a graph is defined to be the minimum sum of mapped values of all vertices among all integer $\{2\}$-dominating functions. In this paper, we compute the integer $\{2\}$-domination numbers of $G_{1,n}$ and $G_{2,n}$, attain an upper bound to the integer $\{2\}$-domination numbers of $G_{3,n}$, and propose an algorithm to count the integer $\{2\}$-domination numbers of $G_{m,n}$ for arbitrary $m$ and $n$. As a future work, we list the integer $\{2\}$-domination numbers of $G_{4,n}$ for small $n$, and conjecture on its formula. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_00134 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The integer $\{2\}$-domination number of grids Lee, Jia-Ying Liu, Chia-An Combinatorics 05C69, 05C85 For positive integers $m$ and $n$, the grid graph $G_{m,n}$ is the Cartesian product of the path graph $P_m$ on $m$ vertices and the path graph $P_n$ on $n$ vertices. An integer $\{2\}$-dominating function of a graph is a mapping from the vertex set to $\{0,1,2\}$ such that the sum of the mapped values of each vertex and its neighbors is at least $2$; the integer $\{2\}$-domination number of a graph is defined to be the minimum sum of mapped values of all vertices among all integer $\{2\}$-dominating functions. In this paper, we compute the integer $\{2\}$-domination numbers of $G_{1,n}$ and $G_{2,n}$, attain an upper bound to the integer $\{2\}$-domination numbers of $G_{3,n}$, and propose an algorithm to count the integer $\{2\}$-domination numbers of $G_{m,n}$ for arbitrary $m$ and $n$. As a future work, we list the integer $\{2\}$-domination numbers of $G_{4,n}$ for small $n$, and conjecture on its formula. |
| title | The integer $\{2\}$-domination number of grids |
| topic | Combinatorics 05C69, 05C85 |
| url | https://arxiv.org/abs/2502.00134 |