A375566 Array read by antidiagonals: T(m,n) = number of minimum dominating sets in the stacked prism graph C_m X P_n.

1, 2, 2, 1, 6, 3, 4, 3, 9, 6, 3, 12, 34, 4, 5, 1, 2, 123, 4, 10, 3, 8, 17, 3, 16, 5, 51, 14, 4, 2, 18, 28, 290, 18, 14, 8, 1, 20, 93, 76, 320, 6, 63, 4, 3, 13, 2, 438, 164, 265, 171, 14, 4, 18, 25, 5, 24, 3, 396, 255, 36, 91, 24, 9, 120, 11, 1, 2, 27, 904, 250, 6, 1526, 60, 2052, 25, 22, 3

Offset: 1

Author

Stephan Mertens, Aug 19 2024

Keywords

• nonn
• tabl
• hard

Examples

			Table starts:
====================================
m\n |   1   2   3    4    5    6 ...
----+-------------------------------
  1 |   1   2   1    4    3    1 ...
  2 |   2   6   3   12    2   17 ...
  3 |   3   9  34  123    3   18 ...
  4 |   6   4   4   16   28   76 ...
  5 |   5  10   5  290  320  265 ...
 ...
		

Links

• Stephan Mertens, Domination Polynomials of the Grid, the Cylinder, the Torus, and the King Graph, arXiv:2408.08053 [math.CO], Aug 2024.
• Eric Weisstein's World of Mathematics, Minimum Dominating Set.
• Eric Weisstein's World of Mathematics, Stacked Prism Graph.

Crossrefs

Main diagonal is A375569.

Rows 1..2 are A347633, A347558.

Column 1 is A347538, column 2 is essentially A347634.

Cf. A286514, A350820, A375603.