Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2504.04233

The Flood Polynomial of a Graph

Karin R. Saoub·Michael Weselcouch·Trey Wilhoit·Jackson Wills
View original source ↗Read source document ↗Export metadata ↓

Abstract

The flood polynomial of a simple finite graph is a weight generating function that counts all flooding cascade sets of the graph. The flood polynomial is inspired by the water mechanics in the video game Minecraft. We give necessary conditions for two graphs to have the same flood polynomial. We then provide a formula for the flood polynomials of certain families of graphs. We will see that many flood polynomials can be expressed using a Fibonacci-like recurrence and in some cases are equal to Fibonacci or Lucas polynomials. We then provide general examples of pairs of distinct graphs with the same flood polynomial. In these examples, the flood polynomial will be expressed as the product of Fibonacci and Lucas polynomials.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Karin R. Saoub, Michael Weselcouch, Trey Wilhoit, Jackson Wills. 2025-04-05. The Flood Polynomial of a Graph. https://arxiv.org/abs/2504.04233

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↗