$k$-Dependence and Domination in Kings Graphs

Simple item page
dc.creatorIonascu, Eugen J.
dc.creatorPritikin, Dan
dc.creatorWright, Stephen E.
dc.date2006-08-05
dc.date.accessioned2026-07-07T07:21:26Z
dc.date.available2026-07-07T07:21:26Z
dc.descriptionWe 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.
dc.description22 pages, 3 figures, submitted in June of 2006
dc.identifierhttps://arxiv.org/abs/math/0608140
dc.identifierhttp://arxiv.org/abs/math/0608140
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115301
dc.subjectOptimization and Control
dc.subjectCombinatorics
dc.subject90C35;90C05
dc.title$k$-Dependence and Domination in Kings Graphs
dc.typetext

Files

Collections

arXiv