Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2408.08053

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

Stephan Mertens
View original source ↗Read source document ↗Export metadata ↓

Abstract

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^2n^2 λ^{2m})$ for the torus and $O(m^3n^2λ^m)$ for the other graphs, where $λ= 1+\sqrt{2}$. The space complexity is $O(mnλ^m)$ for all of these graphs. We use this algorithm to compute domination polynomials for graphs up to size $24\times 24$ and the total number of dominating sets for even larger graphs. This allows us to give precise estimates of the asymptotic growth rates of the number of dominating sets. We also extend several sequences in the Online Encyclopedia of Integer Sequences.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stephan Mertens. 2024-08-15. Domination Polynomials of the Grid, the Cylinder, the Torus, and the King Graph. https://arxiv.org/abs/2408.08053

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗