-Dependence and Domination in Kings Graphs
arXiv:math/0608140
Abstract
We study k-dependence and half domination problems for king's graphs in dimension n (n>1). Various sharp bounds are provided and a few conjectures are formulated in the cases the estimates are not the best possible.
22 pages, 3 figures, submitted in June of 2006