$k$-Dependence and Domination in Kings Graphs
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。