Abstract.
A non-empty set of vertices is called an even dominating set if each vertex in the graph is adjacent to an even number of vertices in the set (adjacency is reflexive). In this paper, the Fibonacci polynomials are studied over GF(2) with particular emphasis on their divisibility properties and their relation to the existence of even dominating sets in grid graphs and properties of a corresponding recurrence.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: March 15, 1999 Final version received: November 8, 1999
Rights and permissions
About this article
Cite this article
Goldwasser, J., Klostermeyer, W. & Ware, H. Fibonacci Polynomials and Parity Domination in Grid Graphs. Graphs Comb 18, 271–283 (2002). https://doi.org/10.1007/s003730200020
Issue Date:
DOI: https://doi.org/10.1007/s003730200020