2025/04/05 by Karin R. Saoub, Saoub, Karin R., Michael Weselcouch +5 · 1 voice
Computer Science · Mathematics · Physics and Astronomy · #Advanced Mathematical Theories and Applications #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #math.CO
paper · pdf · doi:10.48550/arxiv.2504.04233
openalex publication_date 2025/04/05 · arxiv published 2025/04/05 · arxiv updated 2025/04/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.