OFFSET
1,4
COMMENTS
In other words, a(n) is the minimum number of kings that can be placed on an n X n chessboard such that (i) the occupied squares form a single connected component, and (ii) every square is either occupied by a king or adjacent to one that is.
a(17) <= 67; a(18) <= 75; a(19) <= 83; a(20) <= 92.
LINKS
Alexander D. Healy, Examples of (near-)optimal connected dominating sets for n <= 20.
Eric Weisstein's World of Mathematics, Connected Domination Number.
Eric Weisstein's World of Mathematics, King Graph.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Alexander D. Healy, Feb 24 2024
EXTENSIONS
a(13)-a(16) from Andrew Howroyd, Feb 25 2024
STATUS
approved