An explicit construction of optimal dominating and [1, 2]–dominating sets in grid
A dominating set in a graph G is a subset of vertices D such that every vertex in is a neighbor of some vertex of D. The domination number of G is the minimum size of a dominating set of G and it is denoted by γ(G). A dominating set with cardinality γ(G) is called optimal dominating set. Also, a sub...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.06.011 |