Stephan Mertens

collaborators

2 papers

math.CO2024

Domination Polynomials of the Grid, the Cylinder, the Torus, and the King Graph

Stephan Mertens

We present an algorithm to compute the domination polynomial of the $m \times n$ grid, cylinder, and torus graphs and the king graph. The time complexity of the algorithm is $O(m^2…

math.CO2024

Domination by kings is oddly even

Cristopher Moore, Stephan Mertens

The $m \times n$ king graph consists of all locations on an $m \times n$ chessboard, where edges are legal moves of a chess king. %where each vertex represents a square on a chessb…