A375603 Array read by antidiagonals: T(m,n) = domination number of the stacked prism graph C_m X P_n.
1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 3, 4, 3, 3, 2, 3, 4, 4, 4, 4, 4, 3, 3, 4, 5, 5, 6, 5, 4, 3, 3, 5, 6, 6, 7, 6, 6, 4, 3, 4, 5, 7, 7, 8, 8, 7, 6, 5, 4, 4, 6, 7, 8, 9, 9, 9, 8, 7, 6, 4, 4, 6, 8, 9, 10, 10, 11, 10, 10, 8, 6, 4, 5, 7, 9, 10, 11, 12, 12, 12, 12, 10, 9, 6, 5
Offset: 1
Examples
Table starts: ==================================== m\n | 1 2 3 4 5 6 ... ----|------------------------------- 1 | 1 1 1 2 2 2 ... 2 | 1 2 2 3 3 4 ... 3 | 1 2 3 4 4 5 ... 4 | 2 2 3 4 5 6 ... 5 | 2 3 4 6 7 8 ... 6 | 2 4 5 6 8 9 ... ...
Links
- Stephan Mertens, Table of n, a(n) for n = 1..325
- 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, Domination Number.
- Eric Weisstein's World of Mathematics, Stacked Prism Graph.