A075692 Upper irredundance number for queens graph Q_n on n^2 nodes.

1, 1, 2, 4, 5, 7, 9, 11, 13, 15

Offset: 1

Author

Peter Gibbons (peter-g(AT)cs.auckland.ac.nz), Oct 13 2002

Keywords

• nonn
• more

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. A075709.