Computing the Domination Number of Grid Graphs
نویسندگان
چکیده
منابع مشابه
Computing the Domination Number of Grid Graphs
Let γm,n denote the size of a minimum dominating set in the m× n grid graph. For the square grid graph, exact values for γn,n have earlier been published for n 6 19. By using a dynamic programming algorithm, the values of γm,n for m,n 6 29 are here obtained. Minimum dominating sets for square grid graphs up to size 29× 29 are depicted. ∗Supported by the Academy of Finland, Grant No. 132122 and ...
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملTotal domination number of grid graphs
We use the link between the existence of tilings in Manhattan metric with {1}-bowls and minimum total dominating sets of Cartesian products of paths and cycles. From the existence of such a tiling, we deduce the asymptotical values of the total domination numbers of these graphs and we deduce the total domination numbers of some Cartesian products of cycles. Finally, we investigate the problem ...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملTotal Roman domination subdivision number in graphs
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/628