Computer Science – Discrete Mathematics
Scientific paper
2011-02-25
Computer Science
Discrete Mathematics
12 pages, 4 figures
Scientific paper
In this paper, we conclude the calculation of the domination number of all
$n\times m$ grid graphs. Indeed, we prove Chang's conjecture saying that for
every $16\le n\le m$, $\gamma(G_{n,m})=\lfloor\frac{(n+2)(m+2)}{5}\rfloor -4$.
Goncalves Daniel
Pinlou Alexandre
Rao Michaël
Thomassé Stéphan
No associations
LandOfFree
The Domination Number of Grids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Domination Number of Grids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Domination Number of Grids will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-709753