A075709 Upper irredundance number for kings graph K_n on n^2 nodes.
1, 1, 4, 4, 9, 9, 16, 17, 25, 27, 36
Offset: 1
Links
- Matthew D. Kearse and Peter B. Gibbons, Computational Methods and New Results for Chessboard Problems, Australasian Journal of Combinatorics 23 (2001), 253-284.
- Matthew D. Kearse and Peter B. Gibbons, A new lower bound on upper irredundance in the queens' graph, Discrete Math., 256 (2002), 225-242.
Crossrefs
Cf. A075692.