A002567 Number of nonisomorphic solutions to minimal independent dominating set on queens' graph Q(n).

1, 1, 1, 2, 2, 17, 1, 91, 16, 1, 1, 105, 4, 55, 1314, 16, 2, 28

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn
• more

References

• W. Ahrens, Mathematische Unterhaltungen und Spiele, second edition (1910), Vol. 1, p. 301.
• N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• P. B. Gibbons and J. A. Webb, Some new results for the queens domination problem, Australasian Journal of Combinatorics 15 (1997), pp. 145-160.
• Matthew D. Kearse and Peter B. Gibbons, Computational Methods and New Results for Chessboard Problems, Australasian Journal of Combinatorics 23 (2001), 253-284.
• M. A. Sainte-Laguë, Les Réseaux (ou Graphes), Mémorial des Sciences Mathématiques, Fasc. 18, Gauthier-Villars, Paris, 1923, 64 pages. See p. 49.
• M. A. Sainte-Laguë, Les Réseaux (ou Graphes), Mémorial des Sciences Mathématiques, Fasc. 18, Gauthier-Villars, Paris, 1923, 64 pages. See p. 49. [Incomplete annotated scan of title page and pages 18-51]

Crossrefs

See A002568 for the number of distinct solutions.

A075324 gives number of queens required.

Extensions

a(9) corrected by Peter Gibbons, May 30 2004