k-Dependence and Domination in Kings Graphs

2006/08/05 by Eugen J. Ionascu, Ionascu, Eugen J., Dan Pritikin +3
Mathematics · #90C05 #90C35 #Combinatorics (math.CO) #FOS: Mathematics #Optimization and Control (math.OC) #math.CO #math.OC #msc:90C05 #msc:90C35

paper · pdf · doi:10.48550/arxiv.math/0608140

22 pages, 3 figures, submitted in June of 2006

arxiv created 2006/08/05 · arxiv updated 2009/12/01

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.

Related

• Domination by kings is oddly even
• Complexity results for k-domination and \α-domination problems\n and their variants
• Domination Polynomials of the Grid, the Cylinder, the Torus, and the King Graph
• Favaron's Theorem, k-dependence, and Tuza's Conjecture
• The sub-k-domination number of a graph with applications to k-domination