Skip to main content
Log in

Fibonacci Polynomials and Parity Domination in Grid Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Author information

Authors and Affiliations

Authors

Additional information

Received: March 15, 1999 Final version received: November 8, 1999

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730200020