Fibonacci polynomials and parity domination in grid graphs

DOI10.1007/S003730200020zbMath0999.05079OpenAlexW1978836719MaRDI QIDQ1606030

John L. Goldwasser, Henry Ware, William F. Klostermeyer

Publication date: 29 July 2002

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730200020

zbMATH Keywords

finite fieldgrid graphlights outFibonacci polynomialeven dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (14)

On the Dimension of the Space of Harmonic Functions on a Discrete Torus ⋮ Stern polynomials ⋮ Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids ⋮ On the complexity of dominating set problems related to the minimum all-ones problem ⋮ Generalized switch-setting problems ⋮ Periodic binary harmonic functions on lattices ⋮ Construction of \(\sigma^+\)-game solutions on a rectangular grid ⋮ Chasing the Lights in Lights Out ⋮ Resolution of Conjectures Related to Lights Out! and Cartesian Products ⋮ Periodic harmonic functions on lattices and points count in positive characteristic ⋮ Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs ⋮ A Survey of the Game “Lights Out!” ⋮ Lights Out on graphs ⋮ Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture

This page was built for publication: Fibonacci polynomials and parity domination in grid graphs