Eternal protection in grid graphs

Authors

  • Goldwasser, John L.
  • Klostermeyer, William F.
  • Mynhardt C.M.

Abstract

Eternal domination of a graph requires the vertices of the graph to be protected, against infinitely long sequences of attacks, by guards located at vertices, with the requirement that the configuration of guards induces a dominating set at all times. We present results and conjectures for grid graphs for some variations on this problem.

Published

2013-06-09

How to Cite

Goldwasser, John L., Klostermeyer, William F., & Mynhardt C.M. (2013). Eternal protection in grid graphs. Utilitas Mathematica, 91. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/975

Issue

Vol. 91 (2013): Volume 91, 2013

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.