k-Dependence and Domination in Kings Graphs
classification
🧮 math.OC
math.CO
keywords
dominationgraphsbestboundscasesconjecturesdependencedimension
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.