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

1, 1, 1, 3, 37, 1, 13, 638, 21, 1, 1, 1, 41, 588, 25872, 43, 22, 2

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn
• more

References

• W. Ahrens, Mathematische Unterhaltungen und Spiele, second edition (1910), Vol. 1, p. 301.
• W. W. R. Ball and H. S. M. Coxeter, Math'l Rec. and Essays, 13th Ed. Dover, p. 173.
• Teresa W. Haynes, Stephen T. Hedetniemi and Michael A. Henning (eds.), Structures of Domination in Graphs, Springer, 2021. See Table 14 on p. 368.
• 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

• 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 A002564 for number of distinct solutions.

A075458 gives number of queens required.

Extensions

a(16)-a(18) from "Structures of Domination in Graphs" added by Andrey Zabolotskiy, Sep 02 2021