Closing the Gap: Eternal Domination on 3 x n Grids

Authors

  • Margaret-Ellen Messinger Mount Allison University

DOI:

https://doi.org/10.11575/cdm.v12i1.62531

Keywords:

graph protection, all guards move, m-eternal domination

Abstract

The domination number for grid graphs has been a long studied problem; the first results appeared over thirty years ago [Jacobson 1984] and the final results appeared in 2013 [Goncalves 2013]. Grid graphs are a natural class of graphs to consider for the eternal dominating set problem as the domination number forms a lower bound for the eternal domination number.  The 3 x n grid has been considered in several papers, and the difference between the upper and lower bounds for the eternal domination number in the all-guards move model has been reduced to a linear function of n. In this short paper, we provide an upper bound for the eternal domination number which exceeds the lower bound by at most 3.

Downloads

Download data is not yet available.

References

References

[1] J. Arquilla, H. Fredricksen, “Graphing” an Optimal Grand Strategy, Military Operations Research 1(3) (1995) 3-17.

[2] I. Beaton, S. Finbow, J.A. MacDonald, Eternal Domination Numbers of 4 × n Grid Graphs, J. Combin. Math. Combin. Comput. 85 (2013) 33-48.

[3] S. Finbow, S. Gaspers, M.E. Messinger, P. Ottaway, A note on the eternal dominating set problem, submitted.

[4] S. Finbow, M.E. Messinger, M. van Bommel, Eternal Domination of 3 × n grid graphs, Aust. J. of Combin. 61(2) (2015) 156–174.

[5] W. Goddard, S.M Hedetniemi, S.T. Hedetniemi, Eternal Security in Graphs, J. Combin. Math. Combin. Comput. 52 (2005) 169–180.

[6] J.L. Goldwasser, W.F. Klostermeyer, C.M. Mynhardt, Eternal Protection in Grid Graphs, Util. Math. 91 (2013) 47–64.

[7] D. Gonc ̧alves, A. Pinlou, M. Rao, S. Thomass ́e, The Domination Number of Grids, SIAM J. Discrete Math. 25(3), (2011) 1443–1453.

[8] M.S. Jacobson, L.F. Kinch, On the Domination Number of Products of Graphs: I, Ars Combin. 18 (1984) 33–44.

[9] W.F. Klostermeyer, G. MacGillivray, Eternal Dominating Sets in Graphs, J. Combin. Math. Combin. Comput. 68 (2009) 97–111.

[10] W.F. Klostermeyer, C.M. Mynhardt, Protecting a Graph with Mobile Guards (submitted).

[11] C.S. ReVelle, Can You Protect The Roman Empire? John Hopkins Magazine, 50(2), April 1997.

[12] C.S. ReVelle, K.E. Rosing, Defendens Imperium Romanum: A Classical Problem in Military Strategy,

The American Mathematical Monthly 107(7), August - September 2000, 585–594.

[13] I. Stewart, Defend the Roman Empire! Scientific American, December 1999, 136-138.

Downloads

Published

2017-09-27

Issue

Vol. 12 No. 1 (2017)

Section

Articles

License

 

This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).

The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.

Author(s) retain copyright over submissions published starting from  Volume 15 number 3.   When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM)  a world-wide, irrevocable, royalty free,  non-exclusive license as described below:

The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.

The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation. 

The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.

In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.

The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.

If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.

The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.

The journal highly recommends that the work be published with a Creative Commons license.   Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM,  the work will appear with the CC-BY-ND logo.  Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND.  https://creativecommons.org/licenses/

Attribution-NoDerivs
CC BY-ND

This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.