$k$-Dependence and Domination in Kings Graphs
Optimization and Control
2007-05-23 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.math/0608140,
title = {$k$-Dependence and Domination in Kings Graphs},
author = {Eugen J. Ionascu and Dan Pritikin and Stephen E. Wright},
journal= {arXiv preprint arXiv:math/0608140},
year = {2007}
}
Comments
22 pages, 3 figures, submitted in June of 2006